var bibbase_data = {"data":"<img src=\"//bibbase.org/img/ajax-loader.gif\" id=\"spinner\"\n  style=\"display: none;\" alt=\"Loading..\" />\n\n<div id=\"bibbase\">\n\n  <script type=\"text/javascript\">\n    var bibbase = {\n      params: {\"bib\":\"https://research.seas.ucla.edu/licos/files/2023/02/publicactions_v1.bib\",\"authorFirst\":\"1\",\"nocache\":\"1\",\"fullnames\":\"1\",\"theme\":\"bullets\",\"group0\":\"year\",\"group1\":\"type\",\"owner\":\"{}\",\"filter\":\"tags:(WNS|ITSecrecy|WiNetSec)\",\"jsonp\":\"1\",\"host\":\"bibbase.org\"},\n      data: [{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"We consider a group of m trusted nodes that aim to create a shared secret key K over a wireless channel in the presence an eavesdropper Eve. We assume an erasure broadcast channel from one of the honest nodes to the rest of them including Eve. All of the trusted nodes can also discuss over a cost-free public channel which is observed by Eve. For this setup we characterize the secret key generation capacity and propose an achievability scheme that is computationally efficient and employs techniques from network coding. Surprisingly, whether we have m = 2 nodes, or an arbitrary number m of nodes, we can establish a shared secret key among them at the same rate, independently of m.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Siavoshani\"],\"firstnames\":[\"M.J.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Pulleti\"],\"firstnames\":[\"U.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Argyraki\"],\"firstnames\":[\"K.\"],\"suffixes\":[]}],\"booktitle\":\"Signals, Systems and Computers (ASILOMAR), 2010 Conference Record of the Forty Fourth Asilomar Conference on\",\"doi\":\"10.1109/ACSSC.2010.5757657\",\"issn\":\"1058-6393\",\"month\":\"Nov\",\"pages\":\"719-723\",\"tags\":\"conf,IT,WiNetSec\",\"title\":\"Group secret key generation over broadcast erasure channels\",\"year\":\"2010\",\"bibtex\":\"@inproceedings{5757657,\\n abstract = {We consider a group of m trusted nodes that aim to create a shared secret key K over a wireless channel in the presence an eavesdropper Eve. We assume an erasure broadcast channel from one of the honest nodes to the rest of them including Eve. All of the trusted nodes can also discuss over a cost-free public channel which is observed by Eve. For this setup we characterize the secret key generation capacity and propose an achievability scheme that is computationally efficient and employs techniques from network coding. Surprisingly, whether we have m = 2 nodes, or an arbitrary number m of nodes, we can establish a shared secret key among them at the same rate, independently of m.},\\n author = {Siavoshani, M.J. and Fragouli, C. and Diggavi, S. and Pulleti, U. and Argyraki, K.},\\n booktitle = {Signals, Systems and Computers (ASILOMAR), 2010 Conference Record of the Forty Fourth Asilomar Conference on},\\n doi = {10.1109/ACSSC.2010.5757657},\\n issn = {1058-6393},\\n month = {Nov},\\n pages = {719-723},\\n tags = {conf,IT,WiNetSec},\\n title = {Group secret key generation over broadcast erasure channels},\\n type = {4},\\n year = {2010}\\n}\\n\\n\",\"author_short\":[\"Siavoshani, M.\",\"Fragouli, C.\",\"Diggavi, S.\",\"Pulleti, U.\",\"Argyraki, K.\"],\"key\":\"5757657\",\"id\":\"5757657\",\"bibbaseid\":\"siavoshani-fragouli-diggavi-pulleti-argyraki-groupsecretkeygenerationoverbroadcasterasurechannels-2010\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"We consider a group of m trusted nodes that aim to create a shared secret key K, using a state-dependent wireless broadcast channel that exists from one of the honest nodes to the rest of the nodes including a passive eavesdropper Eve. All of the trusted nodes can also discuss over a cost-free and unlimited rate public channel which is also observed by Eve. For this setup, we develop an information-theoretically secure secret key agreement protocol. We show the optimality of this protocol for linear deterministic wireless broadcast channels as well as in the high-SNR regime for wireless channels with large dynamic range over channel states.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Siavoshani\"],\"firstnames\":[\"M.J.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Mishra\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.N.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on\",\"doi\":\"10.1109/ISIT.2011.6033895\",\"file\":\":papers:group_secret_key.pdf\",\"issn\":\"2157-8095\",\"month\":\"July\",\"pages\":\"1960-1964\",\"tags\":\"conf,WiNetSec,IT\",\"title\":\"Group secret key agreement over state-dependent wireless broadcast channels\",\"year\":\"2011\",\"bibtex\":\"@inproceedings{6033895,\\n abstract = {We consider a group of m trusted nodes that aim to create a shared secret key K, using a state-dependent wireless broadcast channel that exists from one of the honest nodes to the rest of the nodes including a passive eavesdropper Eve. All of the trusted nodes can also discuss over a cost-free and unlimited rate public channel which is also observed by Eve. For this setup, we develop an information-theoretically secure secret key agreement protocol. We show the optimality of this protocol for linear deterministic wireless broadcast channels as well as in the high-SNR regime for wireless channels with large dynamic range over channel states.},\\n author = {Siavoshani, M.J. and Mishra, S. and Diggavi, S.N. and Fragouli, C.},\\n booktitle = {Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on},\\n doi = {10.1109/ISIT.2011.6033895},\\n file = {:papers:group_secret_key.pdf},\\n issn = {2157-8095},\\n month = {July},\\n pages = {1960-1964},\\n tags = {conf,WiNetSec,IT},\\n title = {Group secret key agreement over state-dependent wireless broadcast channels},\\n type = {4},\\n year = {2011}\\n}\\n\\n\",\"author_short\":[\"Siavoshani, M.\",\"Mishra, S.\",\"Diggavi, S.\",\"Fragouli, C.\"],\"key\":\"6033895\",\"id\":\"6033895\",\"bibbaseid\":\"siavoshani-mishra-diggavi-fragouli-groupsecretkeyagreementoverstatedependentwirelessbroadcastchannels-2011\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"We characterize the secret message capacity of a wiretapped erasure channel where causal channel state information of the honest nodes is publicly available. In doing so, we establish an intimate connection between message secrecy and secret key generation for the same channel setup. We propose a linear coding scheme that has polynomial encoding/decoding complexity, and prove a converse that shows the optimality of our scheme. Our work also demonstrates the value of causal public feedback, which has previously been shown for the secret key generation problem.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Czap\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Prabhakaran\"],\"firstnames\":[\"V.M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.\"],\"suffixes\":[]}],\"booktitle\":\"Information Theory Workshop (ITW), 2011 IEEE\",\"file\":\":papers:secret_erasure_bc.pdf\",\"month\":\"Oct\",\"pages\":\"65-69\",\"tags\":\"conf,WiNetSec,IT\",\"title\":\"Secret message capacity of erasure broadcast channels with feedback\",\"year\":\"2011\",\"bibtex\":\"@inproceedings{6089579,\\n abstract = {We characterize the secret message capacity of a wiretapped erasure channel where causal channel state information of the honest nodes is publicly available. In doing so, we establish an intimate connection between message secrecy and secret key generation for the same channel setup. We propose a linear coding scheme that has polynomial encoding/decoding complexity, and prove a converse that shows the optimality of our scheme. Our work also demonstrates the value of causal public feedback, which has previously been shown for the secret key generation problem.},\\n author = {Czap, L. and Prabhakaran, V.M. and Fragouli, C. and Diggavi, S.},\\n booktitle = {Information Theory Workshop (ITW), 2011 IEEE},\\n file = {:papers:secret_erasure_bc.pdf},\\n month = {Oct},\\n pages = {65-69},\\n tags = {conf,WiNetSec,IT},\\n title = {Secret message capacity of erasure broadcast channels with feedback},\\n type = {4},\\n year = {2011}\\n}\\n\\n\",\"author_short\":[\"Czap, L.\",\"Prabhakaran, V.\",\"Fragouli, C.\",\"Diggavi, S.\"],\"key\":\"6089579\",\"id\":\"6089579\",\"bibbaseid\":\"czap-prabhakaran-fragouli-diggavi-secretmessagecapacityoferasurebroadcastchannelswithfeedback-2011\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"Information-theoretic secrecy is studied for a parallel relay (diamond) network, in which a transmitter wishes to communicate to a receiver through two relay nodes. While there is no direct link between the transmitter and receiver and all flow of information has to be transmitted through the relays, the message has to be kept secret from each of them. The exact secrecy capacity is characterized for the network under the linear deterministic model. The problem is then studied when each terminal is equipped with multiple antennas, and the channels are parallel Gaussian links. Lower and upper bounds for the secrecy capacity are derived, and the gap is bounded by a constant independent of the channel parameters and SNR. This results in an approximate characterization for the secrecy capacity of the parallel Gaussian diamond network.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Mohajer\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.N.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Poor\"],\"firstnames\":[\"H.V.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Shamai\"],\"firstnames\":[\"S.\"],\"suffixes\":[]}],\"booktitle\":\"Communication, Control, and Computing (Allerton), 2011 49th Annual Allerton Conference on\",\"doi\":\"10.1109/Allerton.2011.6120197\",\"file\":\":papers:parallel_wiretap.pdf\",\"month\":\"Sept\",\"pages\":\"418-425\",\"tags\":\"conf,IT,WiNetSec,WiNet\",\"title\":\"On the parallel relay wire-tap network\",\"year\":\"2011\",\"bibtex\":\"@inproceedings{6120197,\\n abstract = {Information-theoretic secrecy is studied for a parallel relay (diamond) network, in which a transmitter wishes to communicate to a receiver through two relay nodes. While there is no direct link between the transmitter and receiver and all flow of information has to be transmitted through the relays, the message has to be kept secret from each of them. The exact secrecy capacity is characterized for the network under the linear deterministic model. The problem is then studied when each terminal is equipped with multiple antennas, and the channels are parallel Gaussian links. Lower and upper bounds for the secrecy capacity are derived, and the gap is bounded by a constant independent of the channel parameters and SNR. This results in an approximate characterization for the secrecy capacity of the parallel Gaussian diamond network.},\\n author = {Mohajer, S. and Diggavi, S.N. and Poor, H.V. and Shamai, S.},\\n booktitle = {Communication, Control, and Computing (Allerton), 2011 49th Annual Allerton Conference on},\\n doi = {10.1109/Allerton.2011.6120197},\\n file = {:papers:parallel_wiretap.pdf},\\n month = {Sept},\\n pages = {418-425},\\n tags = {conf,IT,WiNetSec,WiNet},\\n title = {On the parallel relay wire-tap network},\\n type = {4},\\n year = {2011}\\n}\\n\\n\",\"author_short\":[\"Mohajer, S.\",\"Diggavi, S.\",\"Poor, H.\",\"Shamai, S.\"],\"key\":\"6120197\",\"id\":\"6120197\",\"bibbaseid\":\"mohajer-diggavi-poor-shamai-ontheparallelrelaywiretapnetwork-2011\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"We study secret-key agreement with public discussion over a flat-fading wiretap channel model. The fading gains are correlated across the receivers and sampled independently at each time. Perfect receiver channel state information (CSI) is assumed, whereas a noisy CSI of the main channel is also available to the transmitter. We propose lower and upper bounds on the capacity. Our lower bound is achieved by a coding scheme that involves a separate binning of the receiver CSI sequence and its channel output sequence. In general it improves upon the joint-binning schemes considered in earlier works. Our upper and lower bounds coincide, establishing the capacity, when either the transmitter has no CSI or when the channel gains of the legitimate receiver and the eavesdropper are statistically independent.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Khisti\"],\"firstnames\":[\"A\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.N.\"],\"suffixes\":[]}],\"booktitle\":\"GLOBECOM Workshops (GC Wkshps), 2011 IEEE\",\"doi\":\"10.1109/GLOCOMW.2011.6162578\",\"file\":\":papers:remark_secret_keygen.pdf\",\"month\":\"Dec\",\"pages\":\"864-868\",\"tags\":\"conf,WiNetSec,IT\",\"title\":\"A remark on secret-key generation over correlated fading channels\",\"year\":\"2011\",\"bibtex\":\"@inproceedings{6162578,\\n abstract = {We study secret-key agreement with public discussion over a flat-fading wiretap channel model. The fading gains are correlated across the receivers and sampled independently at each time. Perfect receiver channel state information (CSI) is assumed, whereas a noisy CSI of the main channel is also available to the transmitter. We propose lower and upper bounds on the capacity. Our lower bound is achieved by a coding scheme that involves a separate binning of the receiver CSI sequence and its channel output sequence. In general it improves upon the joint-binning schemes considered in earlier works. Our upper and lower bounds coincide, establishing the capacity, when either the transmitter has no CSI or when the channel gains of the legitimate receiver and the eavesdropper are statistically independent.},\\n author = {Khisti, A and Diggavi, S.N.},\\n booktitle = {GLOBECOM Workshops (GC Wkshps), 2011 IEEE},\\n doi = {10.1109/GLOCOMW.2011.6162578},\\n file = {:papers:remark_secret_keygen.pdf},\\n month = {Dec},\\n pages = {864-868},\\n tags = {conf,WiNetSec,IT},\\n title = {A remark on secret-key generation over correlated fading channels},\\n type = {4},\\n year = {2011}\\n}\\n\\n\",\"author_short\":[\"Khisti, A\",\"Diggavi, S.\"],\"key\":\"6162578\",\"id\":\"6162578\",\"bibbaseid\":\"khisti-diggavi-aremarkonsecretkeygenerationovercorrelatedfadingchannels-2011\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"In this short review paper we summarize some of our recent results on interactive message secrecy for broadcast erasure channels.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Czap\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Prabhakaran\"],\"firstnames\":[\"V.M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"Communications Control and Signal Processing (ISCCSP), 2012 5th International Symposium on\",\"doi\":\"10.1109/ISCCSP.2012.6217871\",\"file\":\":papers:interactive_secrecy.pdf\",\"month\":\"May\",\"pages\":\"1-4\",\"tags\":\"conf,WiNetSec\",\"title\":\"On interactive secrecy over erasure networks\",\"year\":\"2012\",\"bibtex\":\"@inproceedings{6217871,\\n abstract = {In this short review paper we summarize some of our recent results on interactive message secrecy for broadcast erasure channels.},\\n author = {Czap, L. and Prabhakaran, V.M. and Diggavi, S. and Fragouli, C.},\\n booktitle = {Communications Control and Signal Processing (ISCCSP), 2012 5th International Symposium on},\\n doi = {10.1109/ISCCSP.2012.6217871},\\n file = {:papers:interactive_secrecy.pdf},\\n month = {May},\\n pages = {1-4},\\n tags = {conf,WiNetSec},\\n title = {On interactive secrecy over erasure networks},\\n type = {4},\\n year = {2012}\\n}\\n\\n\",\"author_short\":[\"Czap, L.\",\"Prabhakaran, V.\",\"Diggavi, S.\",\"Fragouli, C.\"],\"key\":\"6217871\",\"id\":\"6217871\",\"bibbaseid\":\"czap-prabhakaran-diggavi-fragouli-oninteractivesecrecyovererasurenetworks-2012\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"Consider a source, Alice, broadcasting private messages to multiple receivers through a broadcast erasure channel; users send back to Alice public feedback that she causally uses to decide the coding strategy for her following transmissions. Recently, the multiple unicast capacity region for this problem has been exactly characterized for a number of special cases; namely the 2-user, 3-user, symmetric K-user, and one-sidedly fair K-user [1], [2]. In this paper, we show that for all the cases where such characterizations exist, we can also optimally characterize the “secure” communication rates, where the message that Alice transmits to each user is information theoretically secure from the other users, even if these collude. We show that a simple, two-phase strategy, where appropriate amounts of secret keys are first generated and then consumed, matches a new outer bound we derive.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Czap\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Prabhakaran\"],\"firstnames\":[\"V.M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on\",\"doi\":\"10.1109/ISIT.2012.6284224\",\"file\":\":papers:bc_private_msg.pdf\",\"issn\":\"2157-8095\",\"month\":\"July\",\"pages\":\"428-432\",\"tags\":\"conf,WiNetSec,IT\",\"title\":\"Broadcasting private messages securely\",\"year\":\"2012\",\"bibtex\":\"@inproceedings{6284224,\\n abstract = {Consider a source, Alice, broadcasting private messages to multiple receivers through a broadcast erasure channel; users send back to Alice public feedback that she causally uses to decide the coding strategy for her following transmissions. Recently, the multiple unicast capacity region for this problem has been exactly characterized for a number of special cases; namely the 2-user, 3-user, symmetric K-user, and one-sidedly fair K-user [1], [2]. In this paper, we show that for all the cases where such characterizations exist, we can also optimally characterize the “secure” communication rates, where the message that Alice transmits to each user is information theoretically secure from the other users, even if these collude. We show that a simple, two-phase strategy, where appropriate amounts of secret keys are first generated and then consumed, matches a new outer bound we derive.},\\n author = {Czap, L. and Prabhakaran, V.M. and Diggavi, S. and Fragouli, C.},\\n booktitle = {Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on},\\n doi = {10.1109/ISIT.2012.6284224},\\n file = {:papers:bc_private_msg.pdf},\\n issn = {2157-8095},\\n month = {July},\\n pages = {428-432},\\n tags = {conf,WiNetSec,IT},\\n title = {Broadcasting private messages securely},\\n type = {4},\\n year = {2012}\\n}\\n\\n\",\"author_short\":[\"Czap, L.\",\"Prabhakaran, V.\",\"Diggavi, S.\",\"Fragouli, C.\"],\"key\":\"6284224\",\"id\":\"6284224\",\"bibbaseid\":\"czap-prabhakaran-diggavi-fragouli-broadcastingprivatemessagessecurely-2012\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"We consider the problem where a group of wireless nodes, connected to the same broadcast domain, want to create pairwise secrets, in the presence of an adversary Eve, who tries to listen in and steal these secrets. Existing solutions assume that Eve cannot perform certain computations (e.g., large-integer factorization) in useful time. We ask the question: can we solve this problem without assuming anything about Eve's computational capabilities? We propose a simple secret-agreement protocol, where the wireless nodes keep exchanging bits until they have agreed on pairwise secrets that Eve cannot reconstruct with very high probability. Our protocol relies on Eve's limited network presence (the fact that she cannot be located at an arbitrary number of points in the network at the same time), but assumes nothing about her computational capabilities. We formally show that, under standard theoretical assumptions, our protocol is information-theoretically secure (it leaks zero information to Eve about the secrets). Using a small wireless testbed of smart-phones, we provide experimental evidence that it is feasible for 5 nodes to create thousands of secret bits per second, with their secrecy being independent from the adversary's capabilities.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Safaka\"],\"firstnames\":[\"I\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Argyraki\"],\"firstnames\":[\"K.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.\"],\"suffixes\":[]}],\"booktitle\":\"INFOCOM, 2013 Proceedings IEEE\",\"doi\":\"10.1109/INFCOM.2013.6567030\",\"file\":\":papers:exchanging_secrets.pdf\",\"issn\":\"0743-166X\",\"month\":\"April\",\"pages\":\"2265-2273\",\"tags\":\"conf,WiNetSec,IT\",\"title\":\"Exchanging pairwise secrets efficiently\",\"year\":\"2013\",\"bibtex\":\"@inproceedings{6567030,\\n abstract = {We consider the problem where a group of wireless nodes, connected to the same broadcast domain, want to create pairwise secrets, in the presence of an adversary Eve, who tries to listen in and steal these secrets. Existing solutions assume that Eve cannot perform certain computations (e.g., large-integer factorization) in useful time. We ask the question: can we solve this problem without assuming anything about Eve's computational capabilities? We propose a simple secret-agreement protocol, where the wireless nodes keep exchanging bits until they have agreed on pairwise secrets that Eve cannot reconstruct with very high probability. Our protocol relies on Eve's limited network presence (the fact that she cannot be located at an arbitrary number of points in the network at the same time), but assumes nothing about her computational capabilities. We formally show that, under standard theoretical assumptions, our protocol is information-theoretically secure (it leaks zero information to Eve about the secrets). Using a small wireless testbed of smart-phones, we provide experimental evidence that it is feasible for 5 nodes to create thousands of secret bits per second, with their secrecy being independent from the adversary's capabilities.},\\n author = {Safaka, I and Fragouli, C. and Argyraki, K. and Diggavi, S.},\\n booktitle = {INFOCOM, 2013 Proceedings IEEE},\\n doi = {10.1109/INFCOM.2013.6567030},\\n file = {:papers:exchanging_secrets.pdf},\\n issn = {0743-166X},\\n month = {April},\\n pages = {2265-2273},\\n tags = {conf,WiNetSec,IT},\\n title = {Exchanging pairwise secrets efficiently},\\n type = {4},\\n year = {2013}\\n}\\n\\n\",\"author_short\":[\"Safaka, I\",\"Fragouli, C.\",\"Argyraki, K.\",\"Diggavi, S.\"],\"key\":\"6567030\",\"id\":\"6567030\",\"bibbaseid\":\"safaka-fragouli-argyraki-diggavi-exchangingpairwisesecretsefficiently-2013\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"Consider a sender, Alice, who wants to transmit private messages to two receivers, Bob and Calvin, using unreliable wireless broadcast transmissions and short public feedback from Bob and Calvin. In [1], we assumed that Bob and Calvin provide honest feedback, and characterized the secure capacity region of the private messages under the requirement that Bob and Calvin do not learn each other's message. In this paper, we assume that Bob (or Calvin) may provide dishonest feedback; or even control the input message distributions, as is commonly assumed in cryptography literature. We characterize the capacity region in the case of dishonest adversaries, as well as an achievable region for the case when the adversary has complete control on the distribution of the messages. We also design polynomial time protocols for both cases, that rely on the use of coding techniques to mix and secure the private messages. As a side result, we define an extended notion of semantic security for this problem and using a similar approach to [2], we show the equivalence of different security notions.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Czap\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Prabhakaran\"],\"firstnames\":[\"V.M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"Network Coding (NetCod), 2013 International Symposium on\",\"doi\":\"10.1109/NetCod.2013.6570819\",\"file\":\":papers:securing_bc.pdf\",\"month\":\"June\",\"pages\":\"1-6\",\"tags\":\"conf,WiNetSec,IT\",\"title\":\"Securing broadcast against dishonest receivers\",\"year\":\"2013\",\"bibtex\":\"@inproceedings{6570819,\\n abstract = {Consider a sender, Alice, who wants to transmit private messages to two receivers, Bob and Calvin, using unreliable wireless broadcast transmissions and short public feedback from Bob and Calvin. In [1], we assumed that Bob and Calvin provide honest feedback, and characterized the secure capacity region of the private messages under the requirement that Bob and Calvin do not learn each other's message. In this paper, we assume that Bob (or Calvin) may provide dishonest feedback; or even control the input message distributions, as is commonly assumed in cryptography literature. We characterize the capacity region in the case of dishonest adversaries, as well as an achievable region for the case when the adversary has complete control on the distribution of the messages. We also design polynomial time protocols for both cases, that rely on the use of coding techniques to mix and secure the private messages. As a side result, we define an extended notion of semantic security for this problem and using a similar approach to [2], we show the equivalence of different security notions.},\\n author = {Czap, L. and Prabhakaran, V.M. and Diggavi, S. and Fragouli, C.},\\n booktitle = {Network Coding (NetCod), 2013 International Symposium on},\\n doi = {10.1109/NetCod.2013.6570819},\\n file = {:papers:securing_bc.pdf},\\n month = {June},\\n pages = {1-6},\\n tags = {conf,WiNetSec,IT},\\n title = {Securing broadcast against dishonest receivers},\\n type = {4},\\n year = {2013}\\n}\\n\\n\",\"author_short\":[\"Czap, L.\",\"Prabhakaran, V.\",\"Diggavi, S.\",\"Fragouli, C.\"],\"key\":\"6570819\",\"id\":\"6570819\",\"bibbaseid\":\"czap-prabhakaran-diggavi-fragouli-securingbroadcastagainstdishonestreceivers-2013\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"We study the problem of secure message multicasting over graphs in the presence of a passive (node) adversary who tries to eavesdrop in the network. We show that use of feedback, facilitated through the existence of cycles or undirected edges, enables higher rates than possible in directed acyclic graphs of the same mincut. We demonstrate this using code constructions for canonical combination networks (CCNs). We also provide general outer bounds as well as schemes for node adversaries over CCNs.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Mishra\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Prabhakaran\"],\"firstnames\":[\"V.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.\"],\"suffixes\":[]}],\"booktitle\":\"Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on\",\"doi\":\"10.1109/ISIT.2013.6620656\",\"issn\":\"2157-8095\",\"month\":\"July\",\"pages\":\"2399-2403\",\"tags\":\"conf,WiNetSec,IT\",\"title\":\"Using feedback for secrecy over graphs\",\"url_arxiv\":\"http://arxiv.org/abs/1305.3051\",\"year\":\"2013\",\"bibtex\":\"@inproceedings{6620656,\\n abstract = {We study the problem of secure message multicasting over graphs in the presence of a passive (node) adversary who tries to eavesdrop in the network. We show that use of feedback, facilitated through the existence of cycles or undirected edges, enables higher rates than possible in directed acyclic graphs of the same mincut. We demonstrate this using code constructions for canonical combination networks (CCNs). We also provide general outer bounds as well as schemes for node adversaries over CCNs.},\\n author = {Mishra, S. and Fragouli, C. and Prabhakaran, V. and Diggavi, S.},\\n booktitle = {Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on},\\n doi = {10.1109/ISIT.2013.6620656},\\n issn = {2157-8095},\\n month = {July},\\n pages = {2399-2403},\\n tags = {conf,WiNetSec,IT},\\n title = {Using feedback for secrecy over graphs},\\n type = {4},\\n url_arxiv = {http://arxiv.org/abs/1305.3051},\\n year = {2013}\\n}\\n\\n\",\"author_short\":[\"Mishra, S.\",\"Fragouli, C.\",\"Prabhakaran, V.\",\"Diggavi, S.\"],\"key\":\"6620656\",\"id\":\"6620656\",\"bibbaseid\":\"mishra-fragouli-prabhakaran-diggavi-usingfeedbackforsecrecyovergraphs-2013\",\"role\":\"author\",\"urls\":{\" arxiv\":\"http://arxiv.org/abs/1305.3051\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"We investigate the problem of secure communication in a simple network with three communicating parties, two distributed sources who communicate over orthogonal channels to one destination node. The cooperation between the sources is restricted to a rate limited common random source they both observe. The communication channels are erasure channels with strictly causal channel state information of the destination available publicly. A passive adversary is present in the system eavesdropping on any one of the channels. We design a linear scheme that ensures secrecy against the eavesdropper. By deriving an outer bound for the problem we prove that the scheme is optimal in certain special cases.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Czap\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Prabhakaran\"],\"firstnames\":[\"V.M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"Information Theory Workshop (ITW), 2013 IEEE\",\"doi\":\"10.1109/ITW.2013.6691232\",\"file\":\":papers:common_randomness.pdf\",\"month\":\"Sept\",\"pages\":\"1-5\",\"tags\":\"conf,WiNetSec,IT\",\"title\":\"Exploiting common randomness: A resource for network secrecy\",\"year\":\"2013\",\"bibtex\":\"@inproceedings{6691232,\\n abstract = {We investigate the problem of secure communication in a simple network with three communicating parties, two distributed sources who communicate over orthogonal channels to one destination node. The cooperation between the sources is restricted to a rate limited common random source they both observe. The communication channels are erasure channels with strictly causal channel state information of the destination available publicly. A passive adversary is present in the system eavesdropping on any one of the channels. We design a linear scheme that ensures secrecy against the eavesdropper. By deriving an outer bound for the problem we prove that the scheme is optimal in certain special cases.},\\n author = {Czap, L. and Prabhakaran, V.M. and Diggavi, S. and Fragouli, C.},\\n booktitle = {Information Theory Workshop (ITW), 2013 IEEE},\\n doi = {10.1109/ITW.2013.6691232},\\n file = {:papers:common_randomness.pdf},\\n month = {Sept},\\n pages = {1-5},\\n tags = {conf,WiNetSec,IT},\\n title = {Exploiting common randomness: A resource for network secrecy},\\n type = {4},\\n year = {2013}\\n}\\n\\n\",\"author_short\":[\"Czap, L.\",\"Prabhakaran, V.\",\"Diggavi, S.\",\"Fragouli, C.\"],\"key\":\"6691232\",\"id\":\"6691232\",\"bibbaseid\":\"czap-prabhakaran-diggavi-fragouli-exploitingcommonrandomnessaresourcefornetworksecrecy-2013\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"Secure network coding assumes that the underlying network links are lossless, thus it can be applied over lossy networks after channel error correction. Yet it is well known that channel losses, such as packet erasures, can be constructively used for secrecy over a link. We address here the challenge of extending these results for arbitrary networks. We provide achievability schemes over erasure networks with feedback, that outperform the alternative approach of channel error correction followed by secure message transmission separation. We derive outer bounds on the securely achievable rate and as a consequence we show optimality of our proposed scheme in some special cases.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Czap\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Prabhakaran\"],\"firstnames\":[\"V.M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.\"],\"suffixes\":[]}],\"booktitle\":\"Communication, Control, and Computing (Allerton), 2013 51st Annual Allerton Conference on\",\"doi\":\"10.1109/Allerton.2013.6736707\",\"file\":\":papers:secure_netcod.pdf\",\"month\":\"Oct\",\"pages\":\"1517-1524\",\"tags\":\"conf,WiNetSec,IT\",\"title\":\"Secure network coding with erasures and feedback\",\"year\":\"2013\",\"bibtex\":\"@inproceedings{6736707,\\n abstract = {Secure network coding assumes that the underlying network links are lossless, thus it can be applied over lossy networks after channel error correction. Yet it is well known that channel losses, such as packet erasures, can be constructively used for secrecy over a link. We address here the challenge of extending these results for arbitrary networks. We provide achievability schemes over erasure networks with feedback, that outperform the alternative approach of channel error correction followed by secure message transmission separation. We derive outer bounds on the securely achievable rate and as a consequence we show optimality of our proposed scheme in some special cases.},\\n author = {Czap, L. and Fragouli, C. and Prabhakaran, V.M. and Diggavi, S.},\\n booktitle = {Communication, Control, and Computing (Allerton), 2013 51st Annual Allerton Conference on},\\n doi = {10.1109/Allerton.2013.6736707},\\n file = {:papers:secure_netcod.pdf},\\n month = {Oct},\\n pages = {1517-1524},\\n tags = {conf,WiNetSec,IT},\\n title = {Secure network coding with erasures and feedback},\\n type = {4},\\n year = {2013}\\n}\\n\\n\",\"author_short\":[\"Czap, L.\",\"Fragouli, C.\",\"Prabhakaran, V.\",\"Diggavi, S.\"],\"key\":\"6736707\",\"id\":\"6736707\",\"bibbaseid\":\"czap-fragouli-prabhakaran-diggavi-securenetworkcodingwitherasuresandfeedback-2013\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"We characterize the secret message capacity of the triangle network, that consists of a source, a relay and a destination connected through orthogonal erasure channels. A passive eavesdropper, Eve, wiretaps any one of the three channels. The source and the relay can each generate unlimited private randomness; the relay and the destination can publicly provide strictly causal channel state information. Our achievable scheme is expressed through a linear program (LP) with 11 inequalities that captures a minimal set of secret key generation methods and the use of them for message encryption. Our outer bound is expressed also through a linear program, in this case with 41 constraints, constructed from general information inequalities. We prove that the optimal value of the outer bound LP is no larger than that of the scheme LP, which implies that the solution of the achievable scheme LP is the capacity. We find that equipping the relay with private randomness increases the secrecy rate by more than 40% in some cases and that cut-set bounds, directly applied in the network, are not always tight. Because the derivation of the inner and outer bound are both lengthy, we describe in this paper the achievability scheme, outline the outer bound, and provide the full derivations online [1]. We also make available Matlab functions that take as input the erasure probabilities and evaluate the inner and outer bounds.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Czap\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Prabhakaran\"],\"firstnames\":[\"V.M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"Information Theory (ISIT), 2014 IEEE International Symposium on\",\"doi\":\"10.1109/ISIT.2014.6874939\",\"file\":\":papers:tri_net_sec.pdf\",\"month\":\"June\",\"pages\":\"781-785\",\"tags\":\"conf,WiNetSec,IT\",\"title\":\"Triangle network secrecy\",\"year\":\"2014\",\"bibtex\":\"@inproceedings{6874939,\\n abstract = {We characterize the secret message capacity of the triangle network, that consists of a source, a relay and a destination connected through orthogonal erasure channels. A passive eavesdropper, Eve, wiretaps any one of the three channels. The source and the relay can each generate unlimited private randomness; the relay and the destination can publicly provide strictly causal channel state information. Our achievable scheme is expressed through a linear program (LP) with 11 inequalities that captures a minimal set of secret key generation methods and the use of them for message encryption. Our outer bound is expressed also through a linear program, in this case with 41 constraints, constructed from general information inequalities. We prove that the optimal value of the outer bound LP is no larger than that of the scheme LP, which implies that the solution of the achievable scheme LP is the capacity. We find that equipping the relay with private randomness increases the secrecy rate by more than 40\\\\% in some cases and that cut-set bounds, directly applied in the network, are not always tight. Because the derivation of the inner and outer bound are both lengthy, we describe in this paper the achievability scheme, outline the outer bound, and provide the full derivations online [1]. We also make available Matlab functions that take as input the erasure probabilities and evaluate the inner and outer bounds.},\\n author = {Czap, L. and Prabhakaran, V.M. and Diggavi, S. and Fragouli, C.},\\n booktitle = {Information Theory (ISIT), 2014 IEEE International Symposium on},\\n doi = {10.1109/ISIT.2014.6874939},\\n file = {:papers:tri_net_sec.pdf},\\n month = {June},\\n pages = {781-785},\\n tags = {conf,WiNetSec,IT},\\n title = {Triangle network secrecy},\\n type = {4},\\n year = {2014}\\n}\\n\\n\",\"author_short\":[\"Czap, L.\",\"Prabhakaran, V.\",\"Diggavi, S.\",\"Fragouli, C.\"],\"key\":\"6874939\",\"id\":\"6874939\",\"bibbaseid\":\"czap-prabhakaran-diggavi-fragouli-trianglenetworksecrecy-2014\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"We consider oblivious transfer between Alice and Bob in the presence of an eavesdropper Eve when there is a broadcast channel from Alice to Bob and Eve. In addition to the secrecy constraints of Alice and Bob, Eve should not learn the private data of Alice and Bob. When the broadcast channel consists of two independent binary erasure channels, we derive the oblivious transfer capacity for both 2-privacy (where the eavesdropper may collude with either party) and 1-privacy (where there are no collusions).\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Mishra\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Dey\"],\"firstnames\":[\"B.K.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Prabhakaran\"],\"firstnames\":[\"V.M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.\"],\"suffixes\":[]}],\"booktitle\":\"Information Theory (ISIT), 2014 IEEE International Symposium on\",\"doi\":\"10.1109/ISIT.2014.6875091\",\"month\":\"June\",\"pages\":\"1539-1543\",\"tags\":\"conf,IT,WiNetSec\",\"title\":\"The oblivious transfer capacity of the wiretapped binary erasure channel\",\"url_arxiv\":\"http://arxiv.org/abs/1404.6614\",\"year\":\"2014\",\"bibtex\":\"@inproceedings{6875091,\\n abstract = {We consider oblivious transfer between Alice and Bob in the presence of an eavesdropper Eve when there is a broadcast channel from Alice to Bob and Eve. In addition to the secrecy constraints of Alice and Bob, Eve should not learn the private data of Alice and Bob. When the broadcast channel consists of two independent binary erasure channels, we derive the oblivious transfer capacity for both 2-privacy (where the eavesdropper may collude with either party) and 1-privacy (where there are no collusions).},\\n author = {Mishra, M. and Dey, B.K. and Prabhakaran, V.M. and Diggavi, S.},\\n booktitle = {Information Theory (ISIT), 2014 IEEE International Symposium on},\\n doi = {10.1109/ISIT.2014.6875091},\\n month = {June},\\n pages = {1539-1543},\\n tags = {conf,IT,WiNetSec},\\n title = {The oblivious transfer capacity of the wiretapped binary erasure channel},\\n type = {4},\\n url_arxiv = {http://arxiv.org/abs/1404.6614},\\n year = {2014}\\n}\\n\\n\",\"author_short\":[\"Mishra, M.\",\"Dey, B.\",\"Prabhakaran, V.\",\"Diggavi, S.\"],\"key\":\"6875091\",\"id\":\"6875091\",\"bibbaseid\":\"mishra-dey-prabhakaran-diggavi-theoblivioustransfercapacityofthewiretappedbinaryerasurechannel-2014\",\"role\":\"author\",\"urls\":{\" arxiv\":\"http://arxiv.org/abs/1404.6614\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"Current security systems often rely on the adversary's computational limitations. Wireless networks offer the opportunity for a different, complementary kind of security, which relies on the adversary's limited network presence (i.e., that the adversary cannot be located at many different points in the network at the same time). We present a system that leverages this opportunity to enable n wireless nodes to create a shared secret S, in a way that an eavesdropper, Eve, obtains very little information on S. Our system consists of two steps: (1) The nodes transmit packets following a special pattern, such that Eve learns very little about a given fraction of the transmitted packets. This is achieved through a combination of beam forming (from many different sources) and wiretap codes. (2) The nodes participate in a protocol that reshuffles the information known to each node, such that the nodes end up sharing a secret that Eve knows very little about. Our protocol is easily implementable in existing wireless devices and scales well with the number of nodes; these properties are achieved through a combination of public feedback, broadcasting, and network coding. We evaluate our system through a 5-node testbed. We demonstrate that a group of wireless nodes can generate thousands of new shared secret bits per second, with their secrecy being independent of the adversary's computational capabilities.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Argyraki\"],\"firstnames\":[\"Katerina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Duarte\"],\"firstnames\":[\"Melissa\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Gatzianas\"],\"firstnames\":[\"Marios\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Kostopoulos\"],\"firstnames\":[\"Panagiotis\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the 19th annual international conference on Mobile computing & networking\",\"file\":\":papers:creating_secrets.pdf\",\"month\":\"Sep\",\"organization\":\"ACM\",\"pages\":\"429–440\",\"tags\":\"conf,WiNetSec,IT\",\"title\":\"Creating secrets out of erasures\",\"year\":\"2013\",\"bibtex\":\"@inproceedings{argyraki2013creating,\\n abstract = {Current security systems often rely on the adversary's computational limitations. Wireless networks offer the opportunity for a different, complementary kind of security, which relies on the adversary's limited network presence (i.e., that the adversary cannot be located at many different points in the network at the same time). We present a system that leverages this opportunity to enable n wireless nodes to create a shared secret S, in a way that an eavesdropper, Eve, obtains very little information on S. Our system consists of two steps: (1) The nodes transmit packets following a special pattern, such that Eve learns very little about a given fraction of the transmitted packets. This is achieved through a combination of beam forming (from many different sources) and wiretap codes. (2) The nodes participate in a protocol that reshuffles the information known to each node, such that the nodes end up sharing a secret that Eve knows very little about. Our protocol is easily implementable in existing wireless devices and scales well with the number of nodes; these properties are achieved through a combination of public feedback, broadcasting, and network coding. We evaluate our system through a 5-node testbed. We demonstrate that a group of wireless nodes can generate thousands of new shared secret bits per second, with their secrecy being independent of the adversary's computational capabilities.},\\n author = {Argyraki, Katerina and Diggavi, Suhas and Duarte, Melissa and Fragouli, Christina and Gatzianas, Marios and Kostopoulos, Panagiotis},\\n booktitle = {Proceedings of the 19th annual international conference on Mobile computing \\\\& networking},\\n file = {:papers:creating_secrets.pdf},\\n month = {Sep},\\n organization = {ACM},\\n pages = {429--440},\\n tags = {conf,WiNetSec,IT},\\n title = {Creating secrets out of erasures},\\n type = {4},\\n year = {2013}\\n}\\n\\n\",\"author_short\":[\"Argyraki, K.\",\"Diggavi, S.\",\"Duarte, M.\",\"Fragouli, C.\",\"Gatzianas, M.\",\"Kostopoulos, P.\"],\"key\":\"argyraki2013creating\",\"id\":\"argyraki2013creating\",\"bibbaseid\":\"argyraki-diggavi-duarte-fragouli-gatzianas-kostopoulos-creatingsecretsoutoferasures-2013\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Czap\"],\"firstnames\":[\"László\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Prabhakaran\"],\"firstnames\":[\"Vinod\",\"M\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Information Theory\",\"number\":\"4\",\"pages\":\"1667–1686\",\"publisher\":\"IEEE\",\"tags\":\"journal,IT,WNS\",\"title\":\"Secure network coding with erasures and feedback\",\"doi\":\"http://dx.doi.org/10.1109/TIT.2015.2402272\",\"volume\":\"61\",\"year\":\"2015\",\"bibtex\":\"@article{czap2015secure,\\n author = {Czap, L{\\\\'a}szl{\\\\'o} and Fragouli, Christina and Prabhakaran, Vinod M and Diggavi, Suhas},\\n journal = {IEEE Transactions on Information Theory},\\n number = {4},\\n pages = {1667--1686},\\n publisher = {IEEE},\\n tags = {journal,IT,WNS},\\n title = {Secure network coding with erasures and feedback},\\n type = {2},\\n doi = {http://dx.doi.org/10.1109/TIT.2015.2402272},\\n volume = {61},\\n year = {2015}\\n}\\n\\n\",\"author_short\":[\"Czap, L.\",\"Fragouli, C.\",\"Prabhakaran, V. M\",\"Diggavi, S.\"],\"key\":\"czap2015secure\",\"id\":\"czap2015secure\",\"bibbaseid\":\"czap-fragouli-prabhakaran-diggavi-securenetworkcodingwitherasuresandfeedback-2015\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Czap\"],\"firstnames\":[\"László\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Prabhakaran\"],\"firstnames\":[\"Vinod\",\"M\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\",\"N\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Information Theory\",\"number\":\"5\",\"pages\":\"2430–2480\",\"publisher\":\"IEEE\",\"tags\":\"journal,IT,WNS\",\"title\":\"An LP Characterization of the Secret-message Capacity of Three Erasure Networks With Feedback\",\"volume\":\"62\",\"year\":\"2016\",\"bibtex\":\"@article{czap2016lp,\\n author = {Czap, L{\\\\'a}szl{\\\\'o} and Prabhakaran, Vinod M and Fragouli, Christina and Diggavi, Suhas N},\\n journal = {IEEE Transactions on Information Theory},\\n number = {5},\\n pages = {2430--2480},\\n publisher = {IEEE},\\n tags = {journal,IT,WNS},\\n title = {An LP Characterization of the Secret-message Capacity of Three Erasure Networks With Feedback},\\n type = {2},\\n volume = {62},\\n year = {2016}\\n}\\n\\n\",\"author_short\":[\"Czap, L.\",\"Prabhakaran, V. M\",\"Fragouli, C.\",\"Diggavi, S. N\"],\"key\":\"czap2016lp\",\"id\":\"czap2016lp\",\"bibbaseid\":\"czap-prabhakaran-fragouli-diggavi-anlpcharacterizationofthesecretmessagecapacityofthreeerasurenetworkswithfeedback-2016\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"author\":[{\"firstnames\":[\"Christina\"],\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"suffixes\":[]},{\"firstnames\":[\"Vinod\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Prabhakaran\"],\"suffixes\":[]},{\"firstnames\":[\"László\"],\"propositions\":[],\"lastnames\":[\"Czap\"],\"suffixes\":[]},{\"firstnames\":[\"Suhas\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]}],\"bibsource\":\"dblp computer science bibliography, http://dblp.org\",\"biburl\":\"http://dblp.uni-trier.de/rec/bib/journals/pieee/FragouliPCD15\",\"file\":\":papers:winetsec_boe.pdf\",\"journal\":\"Proceedings of the IEEE\",\"number\":\"10\",\"pages\":\"1826–1840\",\"tags\":\"journal,WiNetSec,IT\",\"timestamp\":\"Tue, 22 Sep 2015 10:37:29 +0200\",\"title\":\"Wireless Network Security: Building on Erasures\",\"doi\":\"http://dx.doi.org/10.1109/JPROC.2015.2438312\",\"volume\":\"103\",\"year\":\"2015\",\"bibtex\":\"@article{DBLP:journals/pieee/FragouliPCD15,\\n author = {Christina Fragouli and\\nVinod M. Prabhakaran and\\nL{\\\\'{a}}szl{\\\\'{o}} Czap and\\nSuhas N. Diggavi},\\n bibsource = {dblp computer science bibliography, http://dblp.org},\\n biburl = {http://dblp.uni-trier.de/rec/bib/journals/pieee/FragouliPCD15},\\n file = {:papers:winetsec_boe.pdf},\\n journal = {Proceedings of the IEEE},\\n number = {10},\\n pages = {1826--1840},\\n tags = {journal,WiNetSec,IT},\\n timestamp = {Tue, 22 Sep 2015 10:37:29 +0200},\\n title = {Wireless Network Security: Building on Erasures},\\n type = {2},\\n doi = {http://dx.doi.org/10.1109/JPROC.2015.2438312},\\n volume = {103},\\n year = {2015}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Prabhakaran, V. M.\",\"Czap, L.\",\"Diggavi, S. N.\"],\"key\":\"DBLP:journals/pieee/FragouliPCD15\",\"id\":\"DBLP:journals/pieee/FragouliPCD15\",\"bibbaseid\":\"fragouli-prabhakaran-czap-diggavi-wirelessnetworksecuritybuildingonerasures-2015\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"We consider a 1-to-K communication scenario, where a source transmits private messages to K receivers through a broadcast erasure channel, and the receivers feed back strictly causally and publicly their channel states after each transmission. We explore the achievable rate region when we require that the message to each receiver remains secret - in the information theoretical sense - from all the other receivers. We characterize the capacity of secure communication in all the cases where the capacity of the 1-to-K communication scenario without the requirement of security is known. As a special case, we characterize the secret-message capacity of a single receiver point-to-point erasure channel with public state-feedback in the presence of a passive eavesdropper. We find that in all cases where we have an exact characterization, we can achieve the capacity by using linear complexity two-phase schemes: in the first phase we create appropriate secret keys, and in the second phase we use them to encrypt each message. We find that the amount of key we need is smaller than the size of the message, and equal to the amount of encrypted message the potential eavesdroppers jointly collect. Moreover, we prove that a dishonest receiver that provides deceptive feedback cannot diminish the rate experienced by the honest receivers. We also develop a converse proof which reflects the two-phase structure of our achievability scheme. As a side result, our technique leads to a new outer bound proof for the non-secure communication problem.\",\"author\":[{\"firstnames\":[\"László\"],\"propositions\":[],\"lastnames\":[\"Czap\"],\"suffixes\":[]},{\"firstnames\":[\"Vinod\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Prabhakaran\"],\"suffixes\":[]},{\"firstnames\":[\"Christina\"],\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"suffixes\":[]},{\"firstnames\":[\"Suhas\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]}],\"bibsource\":\"dblp computer science bibliography, http://dblp.org\",\"biburl\":\"http://dblp.uni-trier.de/rec/bib/journals/tit/CzapPFD15\",\"doi\":\"10.1109/TIT.2015.2449838\",\"file\":\":papers:SecretCom_Czap.pdf\",\"journal\":\"IEEE Transactions on Information Theory\",\"number\":\"9\",\"pages\":\"4788–4808\",\"tags\":\"journal,WiNetSec,IT\",\"timestamp\":\"Thu, 20 Aug 2015 14:54:38 +0200\",\"title\":\"Secret Communication Over Broadcast Erasure Channels With State-Feedback\",\"url_arxiv\":\"https://arxiv.org/abs/1408.1800\",\"volume\":\"61\",\"year\":\"2015\",\"bibtex\":\"@article{DBLP:journals/tit/CzapPFD15,\\n abstract = {We consider a 1-to-K communication scenario, where a source transmits private messages to K receivers through a broadcast erasure channel, and the receivers feed back strictly causally and publicly their channel states after each transmission. We explore the achievable rate region when we require that the message to each receiver remains secret - in the information theoretical sense - from all the other receivers. We characterize the capacity of secure communication in all the cases where the capacity of the 1-to-K communication scenario without the requirement of security is known. As a special case, we characterize the secret-message capacity of a single receiver point-to-point erasure channel with public state-feedback in the presence of a passive eavesdropper. \\nWe find that in all cases where we have an exact characterization, we can achieve the capacity by using linear complexity two-phase schemes: in the first phase we create appropriate secret keys, and in the second phase we use them to encrypt each message. We find that the amount of key we need is smaller than the size of the message, and equal to the amount of encrypted message the potential eavesdroppers jointly collect. Moreover, we prove that a dishonest receiver that provides deceptive feedback cannot diminish the rate experienced by the honest receivers. \\nWe also develop a converse proof which reflects the two-phase structure of our achievability scheme. As a side result, our technique leads to a new outer bound proof for the non-secure communication problem.},\\n author = {L{\\\\'{a}}szl{\\\\'{o}} Czap and\\nVinod M. Prabhakaran and\\nChristina Fragouli and\\nSuhas N. Diggavi},\\n bibsource = {dblp computer science bibliography, http://dblp.org},\\n biburl = {http://dblp.uni-trier.de/rec/bib/journals/tit/CzapPFD15},\\n doi = {10.1109/TIT.2015.2449838},\\n file = {:papers:SecretCom_Czap.pdf},\\n journal = {IEEE Transactions on Information Theory},\\n number = {9},\\n pages = {4788--4808},\\n tags = {journal,WiNetSec,IT},\\n timestamp = {Thu, 20 Aug 2015 14:54:38 +0200},\\n title = {Secret Communication Over Broadcast Erasure Channels With State-Feedback},\\n type = {2},\\n url_arxiv = {https://arxiv.org/abs/1408.1800},\\n volume = {61},\\n year = {2015}\\n}\\n\\n\",\"author_short\":[\"Czap, L.\",\"Prabhakaran, V. M.\",\"Fragouli, C.\",\"Diggavi, S. N.\"],\"key\":\"DBLP:journals/tit/CzapPFD15\",\"id\":\"DBLP:journals/tit/CzapPFD15\",\"bibbaseid\":\"czap-prabhakaran-fragouli-diggavi-secretcommunicationoverbroadcasterasurechannelswithstatefeedback-2015\",\"role\":\"author\",\"urls\":{\" arxiv\":\"https://arxiv.org/abs/1408.1800\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"The fact that millimeter-wave (mmWave) communication needs to be directional is usually perceived as a challenge; in this letter, we argue that it enables efficient secret key sharing that is unconditionally secure from passive eavesdroppers by building on packet erasures. We showcase the potential of our approach in two setups: 5G networks and vehicle platooning. In both cases, with the right choice of parameters, we can potentially establish keys in the order of tenths of Mb/s. These first results are based on some simplifying assumptions, yet we believe that they give incentives to further explore such techniques.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Karmoose\"],\"firstnames\":[\"Mohammed\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Misoczki\"],\"firstnames\":[\"Rafael\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Yang\"],\"firstnames\":[\"Lily\",\"L\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Zhang\"],\"firstnames\":[\"Zhenliang\"],\"suffixes\":[]}],\"journal\":\"IEEE Communications Letters\",\"number\":\"6\",\"pages\":\"1077–1080\",\"publisher\":\"IEEE\",\"tags\":\"journal,WNS,WiNetnew\",\"title\":\"Using mm-waves for secret key establishment\",\"doi\":\"10.1109/LCOMM.2019.2909918\",\"volume\":\"23\",\"year\":\"2019\",\"bibtex\":\"@article{karmoose2019using,\\n abstract = {The fact that millimeter-wave (mmWave) communication needs to be directional is usually perceived as a challenge; in this letter, we argue that it enables efficient secret key sharing that is unconditionally secure from passive eavesdroppers by building on packet erasures. We showcase the potential of our approach in two setups: 5G networks and vehicle platooning. In both cases, with the right choice of parameters, we can potentially establish keys in the order of tenths of Mb/s. These first results are based on some simplifying assumptions, yet we believe that they give incentives to further explore such techniques.},\\n author = {Karmoose, Mohammed and Fragouli, Christina and Diggavi, Suhas and Misoczki, Rafael and Yang, Lily L and Zhang, Zhenliang},\\n journal = {IEEE Communications Letters},\\n number = {6},\\n pages = {1077--1080},\\n publisher = {IEEE},\\n tags = {journal,WNS,WiNetnew},\\n title = {Using mm-waves for secret key establishment},\\n type = {2},\\n doi = {10.1109/LCOMM.2019.2909918},\\n volume = {23},\\n year = {2019}\\n}\\n\\n\",\"author_short\":[\"Karmoose, M.\",\"Fragouli, C.\",\"Diggavi, S.\",\"Misoczki, R.\",\"Yang, L. L\",\"Zhang, Z.\"],\"key\":\"karmoose2019using\",\"id\":\"karmoose2019using\",\"bibbaseid\":\"karmoose-fragouli-diggavi-misoczki-yang-zhang-usingmmwavesforsecretkeyestablishment-2019\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"We study the secret-key capacity in a joint source-channel coding setup-the terminals are connected over a discrete memoryless channel and have access to side information, modelled as a pair of discrete memoryless source sequences. As our main result, we establish the upper and lower bounds on the secret-key capacity. In the lower bound expression, the equivocation terms of the source and channel components are functionally additive even though the coding scheme generates a single secret-key by jointly taking into account the source and channel equivocations. Our bounds coincide, thus establishing the capacity, when the underlying wiretap channel can be decomposed into a set of independent, parallel, and reversely degraded channels. For the case of parallel Gaussian channels and jointly Gaussian sources we show that Gaussian codebooks achieve the secret-key capacity. In addition, when the eavesdropper also observes a correlated side information sequence, we establish the secret-key capacity when both the source and channel of the eavesdropper are a degraded version of the legitimate receiver. We finally also treat the case when a public discussion channel is available, propose a separation based coding scheme, and establish its optimality when the channel output symbols of the legitimate receiver and eavesdropper are conditionally independent given the input.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Khisti\"],\"firstnames\":[\"A\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.N.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wornell\"],\"firstnames\":[\"Gregory\",\"W.\"],\"suffixes\":[]}],\"doi\":\"10.1109/TIT.2011.2173629\",\"file\":\":papers:secret_keygen.pdf\",\"issn\":\"0018-9448\",\"journal\":\"Information Theory, IEEE Transactions on\",\"label\":\"kdw_j11\",\"month\":\"Feb\",\"number\":\"2\",\"pages\":\"652-670\",\"tags\":\"journal,ITsecrecy,KeyGen,IT,WiNetSec,SrcChanSec\",\"title\":\"Secret-Key Generation Using Correlated Sources and Channels\",\"volume\":\"58\",\"year\":\"2012\",\"bibtex\":\"@article{kdw_j11,\\n abstract = {We study the secret-key capacity in a joint source-channel coding setup-the terminals are connected over a discrete memoryless channel and have access to side information, modelled as a pair of discrete memoryless source sequences. As our main result, we establish the upper and lower bounds on the secret-key capacity. In the lower bound expression, the equivocation terms of the source and channel components are functionally additive even though the coding scheme generates a single secret-key by jointly taking into account the source and channel equivocations. Our bounds coincide, thus establishing the capacity, when the underlying wiretap channel can be decomposed into a set of independent, parallel, and reversely degraded channels. For the case of parallel Gaussian channels and jointly Gaussian sources we show that Gaussian codebooks achieve the secret-key capacity. In addition, when the eavesdropper also observes a correlated side information sequence, we establish the secret-key capacity when both the source and channel of the eavesdropper are a degraded version of the legitimate receiver. We finally also treat the case when a public discussion channel is available, propose a separation based coding scheme, and establish its optimality when the channel output symbols of the legitimate receiver and eavesdropper are conditionally independent given the input.},\\n author = {Khisti, A and Diggavi, S.N. and Wornell, Gregory W.},\\n doi = {10.1109/TIT.2011.2173629},\\n file = {:papers:secret_keygen.pdf},\\n issn = {0018-9448},\\n journal = {Information Theory, IEEE Transactions on},\\n label = {kdw_j11},\\n month = {Feb},\\n number = {2},\\n pages = {652-670},\\n tags = {journal,ITsecrecy,KeyGen,IT,WiNetSec,SrcChanSec},\\n title = {Secret-Key Generation Using Correlated Sources and Channels},\\n type = {2},\\n volume = {58},\\n year = {2012}\\n}\\n\\n\",\"author_short\":[\"Khisti, A\",\"Diggavi, S.\",\"Wornell, G. W.\"],\"key\":\"kdw_j11\",\"id\":\"kdw_j11\",\"bibbaseid\":\"khisti-diggavi-wornell-secretkeygenerationusingcorrelatedsourcesandchannels-2012\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"firstnames\":[\"A.\"],\"propositions\":[],\"lastnames\":[\"Khisti\"],\"suffixes\":[]},{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"G\",\"W.\",\"Wornell\"],\"firstnames\":[\"\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Information Theory (ISIT), Toronto, Canada\",\"month\":\"July\",\"note\":\"\",\"pages\":\"1005–1009\",\"tags\":\"conf,ITsecrecy,KeyGen,IT,WiNetSec,SrcChanSec\",\"title\":\"Secret key generation with correlated sources and noisy channels\",\"year\":\"2008\",\"bibtex\":\"@inproceedings{KDWj08,\\n author = {A. Khisti and S N. Diggavi and G W. Wornell,},\\n booktitle = {IEEE International Symposium on Information Theory (ISIT), Toronto, Canada},\\n month = {July},\\n note = {},\\n pages = {1005--1009},\\n tags = {conf,ITsecrecy,KeyGen,IT,WiNetSec,SrcChanSec},\\n title = {Secret key generation with correlated sources and noisy channels},\\n type = {4},\\n year = {2008}\\n}\\n\\n\",\"author_short\":[\"Khisti, A.\",\"Diggavi, S N.\",\"G W. Wornell, undefined\"],\"key\":\"KDWj08\",\"id\":\"KDWj08\",\"bibbaseid\":\"khisti-diggavi-gwwornell-secretkeygenerationwithcorrelatedsourcesandnoisychannels-2008\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"author\":[{\"firstnames\":[\"A.\"],\"propositions\":[],\"lastnames\":[\"Khisti\"],\"suffixes\":[]},{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"firstnames\":[\"G\",\"W.\"],\"propositions\":[],\"lastnames\":[\"Wornell\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Information Forensics and Security\",\"month\":\"Sep\",\"note\":\"\",\"pages\":\"672-681\",\"tags\":\"journal,ITsecrecy,KeyGen,IT,WiNetSec\",\"title\":\"Secret-key agreement over wiretap channels with random state parameters\",\"url_arxiv\":\"http://arxiv.org/abs/1009.3052\",\"volume\":\"6\",\"year\":\"2011\",\"bibtex\":\"@article{KDWj10,\\n author = {A. Khisti and S N. Diggavi and G W. Wornell},\\n journal = {IEEE Transactions  on Information Forensics and Security},\\n month = {Sep},\\n note = {},\\n pages = {672-681},\\n tags = {journal,ITsecrecy,KeyGen,IT,WiNetSec},\\n title = {Secret-key agreement over wiretap channels with random state parameters},\\n type = {2},\\n url_arxiv = {http://arxiv.org/abs/1009.3052},\\n volume = {6},\\n year = {2011}\\n}\\n\\n\",\"author_short\":[\"Khisti, A.\",\"Diggavi, S N.\",\"Wornell, G W.\"],\"key\":\"KDWj10\",\"id\":\"KDWj10\",\"bibbaseid\":\"khisti-diggavi-wornell-secretkeyagreementoverwiretapchannelswithrandomstateparameters-2011\",\"role\":\"author\",\"urls\":{\" arxiv\":\"http://arxiv.org/abs/1009.3052\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"firstnames\":[\"A.\"],\"propositions\":[],\"lastnames\":[\"Khisti\"],\"suffixes\":[]},{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"firstnames\":[\"G\",\"W.\"],\"propositions\":[],\"lastnames\":[\"Wornell\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Information Theory (ISIT), Seoul, Korea\",\"month\":\"June\",\"note\":\"\",\"pages\":\"2286–2290\",\"tags\":\"conf,ITsecrecy,KeyGen,IT,WiNetSec\",\"title\":\"Secret key agreement using asymmetry in channel state knowledge\",\"year\":\"2009\",\"bibtex\":\"@inproceedings{KTWj09,\\n author = {A. Khisti and S N. Diggavi and G W. Wornell},\\n booktitle = {IEEE International Symposium on Information Theory (ISIT), Seoul, Korea},\\n month = {June},\\n note = {},\\n pages = {2286--2290},\\n tags = {conf,ITsecrecy,KeyGen,IT,WiNetSec},\\n title = {Secret key agreement using asymmetry in channel state knowledge},\\n type = {4},\\n year = {2009}\\n}\\n\\n\",\"author_short\":[\"Khisti, A.\",\"Diggavi, S N.\",\"Wornell, G W.\"],\"key\":\"KTWj09\",\"id\":\"KTWj09\",\"bibbaseid\":\"khisti-diggavi-wornell-secretkeyagreementusingasymmetryinchannelstateknowledge-2009\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Mishra\"],\"firstnames\":[\"Manoj\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Dey\"],\"firstnames\":[\"Bikash\",\"Kumar\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Prabhakaran\"],\"firstnames\":[\"Vinod\",\"M\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\"],\"suffixes\":[]}],\"booktitle\":\"2015 IEEE International Symposium on Information Theory (ISIT)\",\"organization\":\"IEEE\",\"pages\":\"1169–1173\",\"tags\":\"conf,IT,WNS\",\"title\":\"On the oblivious transfer capacity of the degraded wiretapped binary erasure channel\",\"year\":\"2015\",\"bibtex\":\"@inproceedings{mishra2015oblivious,\\n author = {Mishra, Manoj and Dey, Bikash Kumar and Prabhakaran, Vinod M and Diggavi, Suhas},\\n booktitle = {2015 IEEE International Symposium on Information Theory (ISIT)},\\n organization = {IEEE},\\n pages = {1169--1173},\\n tags = {conf,IT,WNS},\\n title = {On the oblivious transfer capacity of the degraded wiretapped binary erasure channel},\\n type = {4},\\n year = {2015}\\n}\\n\\n\",\"author_short\":[\"Mishra, M.\",\"Dey, B. K.\",\"Prabhakaran, V. M\",\"Diggavi, S.\"],\"key\":\"mishra2015oblivious\",\"id\":\"mishra2015oblivious\",\"bibbaseid\":\"mishra-dey-prabhakaran-diggavi-ontheoblivioustransfercapacityofthedegradedwiretappedbinaryerasurechannel-2015\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Mishra\"],\"firstnames\":[\"Manoj\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Dey\"],\"firstnames\":[\"Bikash\",\"Kumar\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Prabhakaran\"],\"firstnames\":[\"Vinod\",\"M\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\",\"N\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Information Theory\",\"number\":\"4\",\"pages\":\"2560–2595\",\"publisher\":\"IEEE\",\"tags\":\"journal,IT,WNS\",\"title\":\"Wiretapped Oblivious Transfer\",\"volume\":\"63\",\"year\":\"2017\",\"bibtex\":\"@article{mishra2017wiretapped,\\n author = {Mishra, Manoj and Dey, Bikash Kumar and Prabhakaran, Vinod M and Diggavi, Suhas N},\\n journal = {IEEE Transactions on Information Theory},\\n number = {4},\\n pages = {2560--2595},\\n publisher = {IEEE},\\n tags = {journal,IT,WNS},\\n title = {Wiretapped Oblivious Transfer},\\n type = {2},\\n volume = {63},\\n year = {2017}\\n}\\n\\n\",\"author_short\":[\"Mishra, M.\",\"Dey, B. K.\",\"Prabhakaran, V. M\",\"Diggavi, S. N\"],\"key\":\"mishra2017wiretapped\",\"id\":\"mishra2017wiretapped\",\"bibbaseid\":\"mishra-dey-prabhakaran-diggavi-wiretappedoblivioustransfer-2017\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Mishra\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Dey\"],\"firstnames\":[\"B.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Prabhakaran\"],\"firstnames\":[\"V.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.N.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Information Theory Workshop (ITW) 2014\",\"file\":\":papers:isit14_mdpd.pdf\",\"month\":\"Nov\",\"tags\":\"conf,IT,WiNetSec\",\"title\":\"On the oblivious transfer capacity region of the binary erasure broadcast channel\",\"year\":\"2014\",\"bibtex\":\"@inproceedings{mishradey14,\\n author = {Mishra, M. and Dey, B. and Prabhakaran, V. and Diggavi, S.N.},\\n booktitle = {IEEE Information Theory Workshop (ITW) 2014},\\n file = {:papers:isit14_mdpd.pdf},\\n month = {Nov},\\n tags = {conf,IT,WiNetSec},\\n title = {On the oblivious transfer capacity region of the binary erasure broadcast channel},\\n type = {4},\\n year = {2014}\\n}\\n\\n\",\"author_short\":[\"Mishra, M.\",\"Dey, B.\",\"Prabhakaran, V.\",\"Diggavi, S.\"],\"key\":\"mishradey14\",\"id\":\"mishradey14\",\"bibbaseid\":\"mishra-dey-prabhakaran-diggavi-ontheoblivioustransfercapacityregionofthebinaryerasurebroadcastchannel-2014\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"This paper studies the idea of noise insertion by authenticated relays through friendly jamming. We develop the secrecy rate achievable in arbitrary (deterministic) networks when there are relays actively helping secrecy.\",\"author\":[{\"firstnames\":[\"E.\"],\"propositions\":[],\"lastnames\":[\"Perron\"],\"suffixes\":[]},{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"E.\",\"Telatar\"],\"firstnames\":[\"\"],\"suffixes\":[]}],\"booktitle\":\"Information Theory and Applications workshop (ITA), UCSD, San Diego, California\",\"file\":\":papers:pdtita09final.pdf\",\"label\":\"pdtc09d\",\"month\":\"February\",\"note\":\"\",\"pages\":\"77–84\",\"tags\":\"conf,ITsecrecy,IT,WiNetSec,WiNetInfFlow,ITapprox,WiNet\",\"title\":\"On noise insertion strategies for wireless network secrecy\",\"year\":\"2009\",\"bibtex\":\"@inproceedings{PDTc09d,\\n abstract = {This paper studies the idea of noise insertion by authenticated relays through friendly jamming. We develop the secrecy rate achievable in arbitrary (deterministic) networks when there are relays actively helping secrecy.},\\n author = {E. Perron and S N. Diggavi and E. Telatar,},\\n booktitle = {Information Theory and Applications workshop (ITA), UCSD, San Diego, California},\\n file = {:papers:pdtita09final.pdf},\\n label = {pdtc09d},\\n month = {February},\\n note = {},\\n pages = {77--84},\\n tags = {conf,ITsecrecy,IT,WiNetSec,WiNetInfFlow,ITapprox,WiNet},\\n title = {On noise insertion strategies for wireless network secrecy},\\n type = {4},\\n year = {2009}\\n}\\n\\n\",\"author_short\":[\"Perron, E.\",\"Diggavi, S N.\",\"E. Telatar, undefined\"],\"key\":\"PDTc09d\",\"id\":\"PDTc09d\",\"bibbaseid\":\"perron-diggavi-etelatar-onnoiseinsertionstrategiesforwirelessnetworksecrecy-2009\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"We study a line network with an eavesdropper having access to the relay transmission. We assume that there could also be a public feedback channel from the destination. We develop achievable strategies to achieve certain rate-equivocation pairs.\",\"author\":[{\"firstnames\":[\"E.\"],\"propositions\":[],\"lastnames\":[\"Perron\"],\"suffixes\":[]},{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"firstnames\":[\"E.\"],\"propositions\":[],\"lastnames\":[\"Telatar\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of Allerton Conference on Communication, Control, and Computing, Illinois\",\"file\":\":papers:pdt_allerton08.pdf\",\"month\":\"September\",\"note\":\"\",\"pages\":\"753–760\",\"tags\":\"conf,ITsecrecy,IT,WiNetSec,WiNetInfFlow,WiNet,InteractiveSec,SelConf\",\"title\":\"Wireless network secrecy with public feedback\",\"year\":\"2008\",\"bibtex\":\"@inproceedings{PDTj08,\\n abstract = {We study a line network with an eavesdropper having access to the\\nrelay transmission. We assume that there could also be a public feedback channel from the destination. We develop achievable strategies to achieve certain rate-equivocation pairs.},\\n author = {E. Perron and S N. Diggavi and E. Telatar},\\n booktitle = {Proceedings of Allerton Conference on Communication, Control, and Computing, Illinois},\\n file = {:papers:pdt_allerton08.pdf},\\n month = {September},\\n note = {},\\n pages = {753--760},\\n tags = {conf,ITsecrecy,IT,WiNetSec,WiNetInfFlow,WiNet,InteractiveSec,SelConf},\\n title = {Wireless network secrecy with public feedback},\\n type = {4},\\n year = {2008}\\n}\\n\\n\",\"author_short\":[\"Perron, E.\",\"Diggavi, S N.\",\"Telatar, E.\"],\"key\":\"PDTj08\",\"id\":\"PDTj08\",\"bibbaseid\":\"perron-diggavi-telatar-wirelessnetworksecrecywithpublicfeedback-2008\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"In this paper we consider secret communication between two special nodes (“source” and “destination”) in a wireless network with authenticated relays: the message communicated to the destination is to be kept information-theoretically (unconditionally) secret from any eavesdropper within a class. Since the transmissions are broadcast and interfere with each other, complex signal interactions occur. We develop cooperative schemes which utilize these interactions in wireless communication over networks with arbitrary topology, and give provable unconditional secrecy guarantees.\",\"author\":[{\"firstnames\":[\"E.\"],\"propositions\":[],\"lastnames\":[\"Perron\"],\"suffixes\":[]},{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"firstnames\":[\"I\",\"E.\"],\"propositions\":[],\"lastnames\":[\"Telatar\"],\"suffixes\":[]}],\"booktitle\":\"IEEE INFOCOM 2009, Rio de Janeiro, Brazil\",\"file\":\":papers:pdtwireless_net_secrecy08.pdf\",\"label\":\"pdt_c09a\",\"month\":\"April\",\"note\":\"\",\"pages\":\"\",\"tags\":\"conf,ITsecrecy,IT,WiNetSec,WiNetInfFlow,WiNet,SelConf\",\"title\":\"On cooperative wireless network secrecy\",\"year\":\"2009\",\"bibtex\":\"@inproceedings{PDTp09,\\n abstract = {In this paper we consider\\nsecret communication between two special nodes (“source” and\\n“destination”) in a wireless network with authenticated relays:\\nthe message communicated to the destination is to be kept\\ninformation-theoretically (unconditionally) secret from any eavesdropper\\nwithin a class. Since the transmissions are broadcast and\\ninterfere with each other, complex signal interactions occur. We\\ndevelop cooperative schemes which utilize these interactions in\\nwireless communication over networks with arbitrary topology,\\nand give provable unconditional secrecy guarantees.},\\n author = {E. Perron and S N. Diggavi and I E. Telatar},\\n booktitle = {IEEE INFOCOM 2009, Rio de Janeiro, Brazil},\\n file = {:papers:pdtwireless_net_secrecy08.pdf},\\n label = {pdt_c09a},\\n month = {April},\\n note = {},\\n pages = {},\\n tags = {conf,ITsecrecy,IT,WiNetSec,WiNetInfFlow,WiNet,SelConf},\\n title = {On cooperative wireless network secrecy},\\n type = {4},\\n year = {2009}\\n}\\n\\n\",\"author_short\":[\"Perron, E.\",\"Diggavi, S N.\",\"Telatar, I E.\"],\"key\":\"PDTp09\",\"id\":\"PDTp09\",\"bibbaseid\":\"perron-diggavi-telatar-oncooperativewirelessnetworksecrecy-2009\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"The compound wiretap channel generalizes the classical problem in broadcast information-theoretic secrecy by allowing a class of potential eavesdroppers. In this paper we present a new coding scheme that generalizes known approaches to this problem. The scheme prefixes an artificial multiple access channel to the transmission scheme in order to design a structured transmit codebook. The idea is that such a structure can potentially increase the perfect secrecy rate for the legitimate users in the presence of the class of eavesdroppers.\",\"author\":[{\"firstnames\":[\"E.\"],\"propositions\":[],\"lastnames\":[\"Perron\"],\"suffixes\":[]},{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"firstnames\":[\"I\",\"E.\"],\"propositions\":[],\"lastnames\":[\"Telatar\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Information Theory Workshop (ITW), Taormina, Italy\",\"file\":\":papers:pdt09mac_wiretap.pdf\",\"month\":\"October\",\"note\":\"\",\"pages\":\"11–15\",\"tags\":\"conf,ITsecrecy,IT,WiNetSec,SelConf\",\"title\":\"A multiple access approach for the compound wiretap channel\",\"year\":\"2009\",\"bibtex\":\"@inproceedings{PDTp09a,\\n abstract = {The compound wiretap channel generalizes the\\nclassical problem in broadcast information-theoretic secrecy by\\nallowing a class of potential eavesdroppers. In this paper we\\npresent a new coding scheme that generalizes known approaches\\nto this problem. The scheme prefixes an artificial multiple\\naccess channel to the transmission scheme in order to design a\\nstructured transmit codebook. The idea is that such a structure\\ncan potentially increase the perfect secrecy rate for the legitimate\\nusers in the presence of the class of eavesdroppers.},\\n author = {E. Perron and S N. Diggavi and I E. Telatar},\\n booktitle = {IEEE Information Theory Workshop (ITW), Taormina, Italy},\\n file = {:papers:pdt09mac_wiretap.pdf},\\n month = {October},\\n note = {},\\n pages = {11--15},\\n tags = {conf,ITsecrecy,IT,WiNetSec,SelConf},\\n title = {A multiple access approach for the compound wiretap channel},\\n type = {4},\\n year = {2009}\\n}\\n\\n\",\"author_short\":[\"Perron, E.\",\"Diggavi, S N.\",\"Telatar, I E.\"],\"key\":\"PDTp09a\",\"id\":\"PDTp09a\",\"bibbaseid\":\"perron-diggavi-telatar-amultipleaccessapproachforthecompoundwiretapchannel-2009\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"Current security systems typically rely on the adversary's computational limitations (e.g., the fact that it cannot invert a hash function or perform large-integer factorization). Wireless networks offer the opportunity for a different, complementary kind of security, which relies not on the adversary's computational limitations, but on its limited network presence (i.e., that the adversary cannot be located at many different points in the network at the same time). We take a first step toward designing and building a wireless security system that leverages this opportunity: We consider the problem where a group of n nodes, connected to the same broadcast wireless network, want to agree on a shared secret (e.g., an encryption key), in the presence of an adversary Eve who tries to listen in and steal the secret. We propose a secret-agreement protocol, where the n nodes of the group keep exchanging bits until they have all agreed on a bit sequence that Eve cannot reconstruct (with very high probability). We provide experimental evidence—to the best of our knowledge, the first one—that a group of wireless nodes can generate thousands of new shared secret bits per second, with their secrecy being independent of the adversary's computational capabilities.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Safaka\"],\"firstnames\":[\"Iris\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Argyraki\"],\"firstnames\":[\"Katerina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the 11th ACM Workshop on Hot Topics in Networks\",\"file\":\":papers:secrets_thin_air.pdf\",\"month\":\"Oct\",\"organization\":\"ACM\",\"pages\":\"73–78\",\"tags\":\"conf,WiNetSec,IT\",\"title\":\"Creating shared secrets out of thin air\",\"year\":\"2012\",\"bibtex\":\"@inproceedings{safaka2012creating,\\n abstract = {Current security systems typically rely on the adversary's computational limitations (e.g., the fact that it cannot invert a hash function or perform large-integer factorization). Wireless networks offer the opportunity for a different, complementary kind of security, which relies not on the adversary's computational limitations, but on its limited network presence (i.e., that the adversary cannot be located at many different points in the network at the same time). We take a first step toward designing and building a wireless security system that leverages this opportunity: We consider the problem where a group of n nodes, connected to the same broadcast wireless network, want to agree on a shared secret (e.g., an encryption key), in the presence of an adversary Eve who tries to listen in and steal the secret. We propose a secret-agreement protocol, where the n nodes of the group keep exchanging bits until they have all agreed on a bit sequence that Eve cannot reconstruct (with very high probability). We provide experimental evidence---to the best of our knowledge, the first one---that a group of wireless nodes can generate thousands of new shared secret bits per second, with their secrecy being independent of the adversary's computational capabilities.},\\n author = {Safaka, Iris and Fragouli, Christina and Argyraki, Katerina and Diggavi, Suhas},\\n booktitle = {Proceedings of the 11th ACM Workshop on Hot Topics in Networks},\\n file = {:papers:secrets_thin_air.pdf},\\n month = {Oct},\\n organization = {ACM},\\n pages = {73--78},\\n tags = {conf,WiNetSec,IT},\\n title = {Creating shared secrets out of thin air},\\n type = {4},\\n year = {2012}\\n}\\n\\n\",\"author_short\":[\"Safaka, I.\",\"Fragouli, C.\",\"Argyraki, K.\",\"Diggavi, S.\"],\"key\":\"safaka2012creating\",\"id\":\"safaka2012creating\",\"bibbaseid\":\"safaka-fragouli-argyraki-diggavi-creatingsharedsecretsoutofthinair-2012\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Siavoshani\"],\"firstnames\":[\"Mahdi\",\"Jafari\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Mishra\"],\"firstnames\":[\"Shaunak\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\",\"N\"],\"suffixes\":[]}],\"file\":\":papers:siavoshani_secretkey.pdf\",\"journal\":\"IEEE Transactions on Information Forensics and Security\",\"number\":\"2\",\"pages\":\"323–337\",\"publisher\":\"IEEE\",\"tags\":\"journal,IT,WiNetSec\",\"title\":\"Multi-Party Secret Key Agreement Over State-Dependent Wireless Broadcast Channels\",\"volume\":\"12\",\"year\":\"2017\",\"bibtex\":\"@article{siavoshani2017multi,\\n author = {Siavoshani, Mahdi Jafari and Mishra, Shaunak and Fragouli, Christina and Diggavi, Suhas N},\\n file = {:papers:siavoshani_secretkey.pdf},\\n journal = {IEEE Transactions on Information Forensics and Security},\\n number = {2},\\n pages = {323--337},\\n publisher = {IEEE},\\n tags = {journal,IT,WiNetSec},\\n title = {Multi-Party Secret Key Agreement Over State-Dependent Wireless Broadcast Channels},\\n type = {2},\\n volume = {12},\\n year = {2017}\\n}\\n\\n\",\"author_short\":[\"Siavoshani, M. J.\",\"Mishra, S.\",\"Fragouli, C.\",\"Diggavi, S. N\"],\"key\":\"siavoshani2017multi\",\"id\":\"siavoshani2017multi\",\"bibbaseid\":\"siavoshani-mishra-fragouli-diggavi-multipartysecretkeyagreementoverstatedependentwirelessbroadcastchannels-2017\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"}],\n      metadata: {\"authorlinks\":{}},\n      ownerID: undefined\n    };\n  </script>\n\n  <script type=\"text/javascript\">\n  var site$;\n  if (typeof $ != 'undefined') {\n    console.log('existing jquery: storing and then restoring');\n    site$ = $;\n    $ = null;\n  }\n  </script>\n\n  <script src=\"https://ajax.googleapis.com/ajax/libs/jquery/2.2.4/jquery.min.js\">\n  </script>\n  <script type=\"text/javascript\">\n  if (site$) {\n    console.log('existing jquery: avoiding conflict and restoring');\n    bb$ = $.noConflict(true);\n    $ = site$;\n  } else {\n    bb$ = $;\n  }\n  </script>\n\n  <script src=\"//bibbase.org/js/bibbase.min.js\"\n          type=\"text/javascript\">\n  </script>\n\n  <script type=\"text/javascript\"\n          src=\"https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config=TeX-AMS-MML_HTMLorMML\">\n  </script>\n  <script type=\"text/x-mathjax-config\">\n    MathJax.Hub.Config({tex2jax: {inlineMath: [['$','$'], ['\\\\(','\\\\)']]},\n                        skipTags: [\"body\"],\n                        processClass: \"bibbase_paper\"});\n  </script>\n\n  <style>\n  @media print {\n    .dontprint {\n        display: none !important;\n    }\n\n  .bibbase_group {\n    background-color: #E0E0E0;\n    font-style: italic;\n    font-size: larger;\n    text-shadow: 0px 0px 3px #FFFFFF;\n    border-radius: 4px 4px 4px 4px;\n    -moz-border-radius: 4px 4px 4px 4px;\n    -webkit-border-radius: 4px;\n    padding: 5px 40px 5px;\n    margin-top: 10px;\n    margin-bottom: 5px;\n    cursor: pointer;\n  }\n\n  .bibbase_paper {\n    margin-bottom: 5px;\n  }\n\n  }\n  </style>\n\n  \n  <div style=\"float: right; margin-right: 10px; margin-top: 10px; text-align: right; font-size: 12px\">\n    generated by\n    <a href=\"//bibbase.org\"\n       onclick=\"trackOutboundLink('bibbase', 'logo clicked', window.location.href, '//bibbase.org'); return false;\">\n      <img src=\"//bibbase.org/img/logo.svg\"\n           style=\"vertical-align: middle; margin-left: 3px; height: 16px;\"/\n           alt=\"bibbase.org\"\n           title=\"BibBase – The easiest way to maintain your publications page.\"\n        ></a>\n    \n  </div>\n  \n\n  <div id=\"bibbase_header\" class=\"dontprint\" style=\"\">\n\n    <ul class=\"nav nav-pills\" style=\"margin: 0px;\">\n\n      <li class=\"dropdown\" id=\"groupby_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\">\n          Group by\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li class=\"groupby year\"><a onclick=\"groupby('year')\">\n            Year</a>\n        </li>\n        <li class=\"groupby author\"><a onclick=\"groupby('author_short')\">\n            Author</a>\n        </li>\n        <li class=\"groupby type\"><a onclick=\"groupby('type')\">\n            Type</a>\n        </li>\n        <li class=\"groupby keyword\"><a onclick=\"groupby('keyword')\">\n            Keyword</a>\n        </li>\n        <li class=\"groupby downloads\"><a onclick=\"groupby('downloads')\">\n            Downloads</a>\n        </li>\n      </ul>\n      </li>\n\n\n      <li class=\"dropdown\" id=\"menu_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\" alt=\"controls\">\n          <i class=\"fa fa-reorder\" alt=\"controls\"></i>\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li>\n          <a onclick=\"toggleAll()\">\n            <i class=\"fa fa-chevron-down fa-fw\"></i> Expand/Collapse All\n          </a>\n        </li>\n        <li>\n          <a download=\"publicactions_v1.bib\" href=\"data:text/bibtex;base64,@inproceedings{5757657,
 abstract = {We consider a group of m trusted nodes that aim to create a shared secret key K over a wireless channel in the presence an eavesdropper Eve. We assume an erasure broadcast channel from one of the honest nodes to the rest of them including Eve. All of the trusted nodes can also discuss over a cost-free public channel which is observed by Eve. For this setup we characterize the secret key generation capacity and propose an achievability scheme that is computationally efficient and employs techniques from network coding. Surprisingly, whether we have m = 2 nodes, or an arbitrary number m of nodes, we can establish a shared secret key among them at the same rate, independently of m.},
 author = {Siavoshani, M.J. and Fragouli, C. and Diggavi, S. and Pulleti, U. and Argyraki, K.},
 booktitle = {Signals, Systems and Computers (ASILOMAR), 2010 Conference Record of the Forty Fourth Asilomar Conference on},
 doi = {10.1109/ACSSC.2010.5757657},
 issn = {1058-6393},
 month = {Nov},
 pages = {719-723},
 tags = {conf,IT,WiNetSec},
 title = {Group secret key generation over broadcast erasure channels},
 type = {4},
 year = {2010}
}



@inproceedings{6033895,
 abstract = {We consider a group of m trusted nodes that aim to create a shared secret key K, using a state-dependent wireless broadcast channel that exists from one of the honest nodes to the rest of the nodes including a passive eavesdropper Eve. All of the trusted nodes can also discuss over a cost-free and unlimited rate public channel which is also observed by Eve. For this setup, we develop an information-theoretically secure secret key agreement protocol. We show the optimality of this protocol for linear deterministic wireless broadcast channels as well as in the high-SNR regime for wireless channels with large dynamic range over channel states.},
 author = {Siavoshani, M.J. and Mishra, S. and Diggavi, S.N. and Fragouli, C.},
 booktitle = {Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on},
 doi = {10.1109/ISIT.2011.6033895},
 file = {:papers:group_secret_key.pdf},
 issn = {2157-8095},
 month = {July},
 pages = {1960-1964},
 tags = {conf,WiNetSec,IT},
 title = {Group secret key agreement over state-dependent wireless broadcast channels},
 type = {4},
 year = {2011}
}



@inproceedings{6089579,
 abstract = {We characterize the secret message capacity of a wiretapped erasure channel where causal channel state information of the honest nodes is publicly available. In doing so, we establish an intimate connection between message secrecy and secret key generation for the same channel setup. We propose a linear coding scheme that has polynomial encoding/decoding complexity, and prove a converse that shows the optimality of our scheme. Our work also demonstrates the value of causal public feedback, which has previously been shown for the secret key generation problem.},
 author = {Czap, L. and Prabhakaran, V.M. and Fragouli, C. and Diggavi, S.},
 booktitle = {Information Theory Workshop (ITW), 2011 IEEE},
 file = {:papers:secret_erasure_bc.pdf},
 month = {Oct},
 pages = {65-69},
 tags = {conf,WiNetSec,IT},
 title = {Secret message capacity of erasure broadcast channels with feedback},
 type = {4},
 year = {2011}
}



@inproceedings{6120197,
 abstract = {Information-theoretic secrecy is studied for a parallel relay (diamond) network, in which a transmitter wishes to communicate to a receiver through two relay nodes. While there is no direct link between the transmitter and receiver and all flow of information has to be transmitted through the relays, the message has to be kept secret from each of them. The exact secrecy capacity is characterized for the network under the linear deterministic model. The problem is then studied when each terminal is equipped with multiple antennas, and the channels are parallel Gaussian links. Lower and upper bounds for the secrecy capacity are derived, and the gap is bounded by a constant independent of the channel parameters and SNR. This results in an approximate characterization for the secrecy capacity of the parallel Gaussian diamond network.},
 author = {Mohajer, S. and Diggavi, S.N. and Poor, H.V. and Shamai, S.},
 booktitle = {Communication, Control, and Computing (Allerton), 2011 49th Annual Allerton Conference on},
 doi = {10.1109/Allerton.2011.6120197},
 file = {:papers:parallel_wiretap.pdf},
 month = {Sept},
 pages = {418-425},
 tags = {conf,IT,WiNetSec,WiNet},
 title = {On the parallel relay wire-tap network},
 type = {4},
 year = {2011}
}



@inproceedings{6162578,
 abstract = {We study secret-key agreement with public discussion over a flat-fading wiretap channel model. The fading gains are correlated across the receivers and sampled independently at each time. Perfect receiver channel state information (CSI) is assumed, whereas a noisy CSI of the main channel is also available to the transmitter. We propose lower and upper bounds on the capacity. Our lower bound is achieved by a coding scheme that involves a separate binning of the receiver CSI sequence and its channel output sequence. In general it improves upon the joint-binning schemes considered in earlier works. Our upper and lower bounds coincide, establishing the capacity, when either the transmitter has no CSI or when the channel gains of the legitimate receiver and the eavesdropper are statistically independent.},
 author = {Khisti, A and Diggavi, S.N.},
 booktitle = {GLOBECOM Workshops (GC Wkshps), 2011 IEEE},
 doi = {10.1109/GLOCOMW.2011.6162578},
 file = {:papers:remark_secret_keygen.pdf},
 month = {Dec},
 pages = {864-868},
 tags = {conf,WiNetSec,IT},
 title = {A remark on secret-key generation over correlated fading channels},
 type = {4},
 year = {2011}
}



@inproceedings{6217871,
 abstract = {In this short review paper we summarize some of our recent results on interactive message secrecy for broadcast erasure channels.},
 author = {Czap, L. and Prabhakaran, V.M. and Diggavi, S. and Fragouli, C.},
 booktitle = {Communications Control and Signal Processing (ISCCSP), 2012 5th International Symposium on},
 doi = {10.1109/ISCCSP.2012.6217871},
 file = {:papers:interactive_secrecy.pdf},
 month = {May},
 pages = {1-4},
 tags = {conf,WiNetSec},
 title = {On interactive secrecy over erasure networks},
 type = {4},
 year = {2012}
}



@inproceedings{6284224,
 abstract = {Consider a source, Alice, broadcasting private messages to multiple receivers through a broadcast erasure channel; users send back to Alice public feedback that she causally uses to decide the coding strategy for her following transmissions. Recently, the multiple unicast capacity region for this problem has been exactly characterized for a number of special cases; namely the 2-user, 3-user, symmetric K-user, and one-sidedly fair K-user [1], [2]. In this paper, we show that for all the cases where such characterizations exist, we can also optimally characterize the “secure” communication rates, where the message that Alice transmits to each user is information theoretically secure from the other users, even if these collude. We show that a simple, two-phase strategy, where appropriate amounts of secret keys are first generated and then consumed, matches a new outer bound we derive.},
 author = {Czap, L. and Prabhakaran, V.M. and Diggavi, S. and Fragouli, C.},
 booktitle = {Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on},
 doi = {10.1109/ISIT.2012.6284224},
 file = {:papers:bc_private_msg.pdf},
 issn = {2157-8095},
 month = {July},
 pages = {428-432},
 tags = {conf,WiNetSec,IT},
 title = {Broadcasting private messages securely},
 type = {4},
 year = {2012}
}



@inproceedings{6567030,
 abstract = {We consider the problem where a group of wireless nodes, connected to the same broadcast domain, want to create pairwise secrets, in the presence of an adversary Eve, who tries to listen in and steal these secrets. Existing solutions assume that Eve cannot perform certain computations (e.g., large-integer factorization) in useful time. We ask the question: can we solve this problem without assuming anything about Eve's computational capabilities? We propose a simple secret-agreement protocol, where the wireless nodes keep exchanging bits until they have agreed on pairwise secrets that Eve cannot reconstruct with very high probability. Our protocol relies on Eve's limited network presence (the fact that she cannot be located at an arbitrary number of points in the network at the same time), but assumes nothing about her computational capabilities. We formally show that, under standard theoretical assumptions, our protocol is information-theoretically secure (it leaks zero information to Eve about the secrets). Using a small wireless testbed of smart-phones, we provide experimental evidence that it is feasible for 5 nodes to create thousands of secret bits per second, with their secrecy being independent from the adversary's capabilities.},
 author = {Safaka, I and Fragouli, C. and Argyraki, K. and Diggavi, S.},
 booktitle = {INFOCOM, 2013 Proceedings IEEE},
 doi = {10.1109/INFCOM.2013.6567030},
 file = {:papers:exchanging_secrets.pdf},
 issn = {0743-166X},
 month = {April},
 pages = {2265-2273},
 tags = {conf,WiNetSec,IT},
 title = {Exchanging pairwise secrets efficiently},
 type = {4},
 year = {2013}
}



@inproceedings{6570819,
 abstract = {Consider a sender, Alice, who wants to transmit private messages to two receivers, Bob and Calvin, using unreliable wireless broadcast transmissions and short public feedback from Bob and Calvin. In [1], we assumed that Bob and Calvin provide honest feedback, and characterized the secure capacity region of the private messages under the requirement that Bob and Calvin do not learn each other's message. In this paper, we assume that Bob (or Calvin) may provide dishonest feedback; or even control the input message distributions, as is commonly assumed in cryptography literature. We characterize the capacity region in the case of dishonest adversaries, as well as an achievable region for the case when the adversary has complete control on the distribution of the messages. We also design polynomial time protocols for both cases, that rely on the use of coding techniques to mix and secure the private messages. As a side result, we define an extended notion of semantic security for this problem and using a similar approach to [2], we show the equivalence of different security notions.},
 author = {Czap, L. and Prabhakaran, V.M. and Diggavi, S. and Fragouli, C.},
 booktitle = {Network Coding (NetCod), 2013 International Symposium on},
 doi = {10.1109/NetCod.2013.6570819},
 file = {:papers:securing_bc.pdf},
 month = {June},
 pages = {1-6},
 tags = {conf,WiNetSec,IT},
 title = {Securing broadcast against dishonest receivers},
 type = {4},
 year = {2013}
}



@inproceedings{6620656,
 abstract = {We study the problem of secure message multicasting over graphs in the presence of a passive (node) adversary who tries to eavesdrop in the network. We show that use of feedback, facilitated through the existence of cycles or undirected edges, enables higher rates than possible in directed acyclic graphs of the same mincut. We demonstrate this using code constructions for canonical combination networks (CCNs). We also provide general outer bounds as well as schemes for node adversaries over CCNs.},
 author = {Mishra, S. and Fragouli, C. and Prabhakaran, V. and Diggavi, S.},
 booktitle = {Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on},
 doi = {10.1109/ISIT.2013.6620656},
 issn = {2157-8095},
 month = {July},
 pages = {2399-2403},
 tags = {conf,WiNetSec,IT},
 title = {Using feedback for secrecy over graphs},
 type = {4},
 url_arxiv = {http://arxiv.org/abs/1305.3051},
 year = {2013}
}



@inproceedings{6691232,
 abstract = {We investigate the problem of secure communication in a simple network with three communicating parties, two distributed sources who communicate over orthogonal channels to one destination node. The cooperation between the sources is restricted to a rate limited common random source they both observe. The communication channels are erasure channels with strictly causal channel state information of the destination available publicly. A passive adversary is present in the system eavesdropping on any one of the channels. We design a linear scheme that ensures secrecy against the eavesdropper. By deriving an outer bound for the problem we prove that the scheme is optimal in certain special cases.},
 author = {Czap, L. and Prabhakaran, V.M. and Diggavi, S. and Fragouli, C.},
 booktitle = {Information Theory Workshop (ITW), 2013 IEEE},
 doi = {10.1109/ITW.2013.6691232},
 file = {:papers:common_randomness.pdf},
 month = {Sept},
 pages = {1-5},
 tags = {conf,WiNetSec,IT},
 title = {Exploiting common randomness: A resource for network secrecy},
 type = {4},
 year = {2013}
}



@inproceedings{6736707,
 abstract = {Secure network coding assumes that the underlying network links are lossless, thus it can be applied over lossy networks after channel error correction. Yet it is well known that channel losses, such as packet erasures, can be constructively used for secrecy over a link. We address here the challenge of extending these results for arbitrary networks. We provide achievability schemes over erasure networks with feedback, that outperform the alternative approach of channel error correction followed by secure message transmission separation. We derive outer bounds on the securely achievable rate and as a consequence we show optimality of our proposed scheme in some special cases.},
 author = {Czap, L. and Fragouli, C. and Prabhakaran, V.M. and Diggavi, S.},
 booktitle = {Communication, Control, and Computing (Allerton), 2013 51st Annual Allerton Conference on},
 doi = {10.1109/Allerton.2013.6736707},
 file = {:papers:secure_netcod.pdf},
 month = {Oct},
 pages = {1517-1524},
 tags = {conf,WiNetSec,IT},
 title = {Secure network coding with erasures and feedback},
 type = {4},
 year = {2013}
}



@inproceedings{6874939,
 abstract = {We characterize the secret message capacity of the triangle network, that consists of a source, a relay and a destination connected through orthogonal erasure channels. A passive eavesdropper, Eve, wiretaps any one of the three channels. The source and the relay can each generate unlimited private randomness; the relay and the destination can publicly provide strictly causal channel state information. Our achievable scheme is expressed through a linear program (LP) with 11 inequalities that captures a minimal set of secret key generation methods and the use of them for message encryption. Our outer bound is expressed also through a linear program, in this case with 41 constraints, constructed from general information inequalities. We prove that the optimal value of the outer bound LP is no larger than that of the scheme LP, which implies that the solution of the achievable scheme LP is the capacity. We find that equipping the relay with private randomness increases the secrecy rate by more than 40\% in some cases and that cut-set bounds, directly applied in the network, are not always tight. Because the derivation of the inner and outer bound are both lengthy, we describe in this paper the achievability scheme, outline the outer bound, and provide the full derivations online [1]. We also make available Matlab functions that take as input the erasure probabilities and evaluate the inner and outer bounds.},
 author = {Czap, L. and Prabhakaran, V.M. and Diggavi, S. and Fragouli, C.},
 booktitle = {Information Theory (ISIT), 2014 IEEE International Symposium on},
 doi = {10.1109/ISIT.2014.6874939},
 file = {:papers:tri_net_sec.pdf},
 month = {June},
 pages = {781-785},
 tags = {conf,WiNetSec,IT},
 title = {Triangle network secrecy},
 type = {4},
 year = {2014}
}



@inproceedings{6875091,
 abstract = {We consider oblivious transfer between Alice and Bob in the presence of an eavesdropper Eve when there is a broadcast channel from Alice to Bob and Eve. In addition to the secrecy constraints of Alice and Bob, Eve should not learn the private data of Alice and Bob. When the broadcast channel consists of two independent binary erasure channels, we derive the oblivious transfer capacity for both 2-privacy (where the eavesdropper may collude with either party) and 1-privacy (where there are no collusions).},
 author = {Mishra, M. and Dey, B.K. and Prabhakaran, V.M. and Diggavi, S.},
 booktitle = {Information Theory (ISIT), 2014 IEEE International Symposium on},
 doi = {10.1109/ISIT.2014.6875091},
 month = {June},
 pages = {1539-1543},
 tags = {conf,IT,WiNetSec},
 title = {The oblivious transfer capacity of the wiretapped binary erasure channel},
 type = {4},
 url_arxiv = {http://arxiv.org/abs/1404.6614},
 year = {2014}
}



@inproceedings{argyraki2013creating,
 abstract = {Current security systems often rely on the adversary's computational limitations. Wireless networks offer the opportunity for a different, complementary kind of security, which relies on the adversary's limited network presence (i.e., that the adversary cannot be located at many different points in the network at the same time). We present a system that leverages this opportunity to enable n wireless nodes to create a shared secret S, in a way that an eavesdropper, Eve, obtains very little information on S. Our system consists of two steps: (1) The nodes transmit packets following a special pattern, such that Eve learns very little about a given fraction of the transmitted packets. This is achieved through a combination of beam forming (from many different sources) and wiretap codes. (2) The nodes participate in a protocol that reshuffles the information known to each node, such that the nodes end up sharing a secret that Eve knows very little about. Our protocol is easily implementable in existing wireless devices and scales well with the number of nodes; these properties are achieved through a combination of public feedback, broadcasting, and network coding. We evaluate our system through a 5-node testbed. We demonstrate that a group of wireless nodes can generate thousands of new shared secret bits per second, with their secrecy being independent of the adversary's computational capabilities.},
 author = {Argyraki, Katerina and Diggavi, Suhas and Duarte, Melissa and Fragouli, Christina and Gatzianas, Marios and Kostopoulos, Panagiotis},
 booktitle = {Proceedings of the 19th annual international conference on Mobile computing \& networking},
 file = {:papers:creating_secrets.pdf},
 month = {Sep},
 organization = {ACM},
 pages = {429--440},
 tags = {conf,WiNetSec,IT},
 title = {Creating secrets out of erasures},
 type = {4},
 year = {2013}
}



@article{czap2015secure,
 author = {Czap, L{\'a}szl{\'o} and Fragouli, Christina and Prabhakaran, Vinod M and Diggavi, Suhas},
 journal = {IEEE Transactions on Information Theory},
 number = {4},
 pages = {1667--1686},
 publisher = {IEEE},
 tags = {journal,IT,WNS},
 title = {Secure network coding with erasures and feedback},
 type = {2},
 doi = {http://dx.doi.org/10.1109/TIT.2015.2402272},
 volume = {61},
 year = {2015}
}



@article{czap2016lp,
 author = {Czap, L{\'a}szl{\'o} and Prabhakaran, Vinod M and Fragouli, Christina and Diggavi, Suhas N},
 journal = {IEEE Transactions on Information Theory},
 number = {5},
 pages = {2430--2480},
 publisher = {IEEE},
 tags = {journal,IT,WNS},
 title = {An LP Characterization of the Secret-message Capacity of Three Erasure Networks With Feedback},
 type = {2},
 volume = {62},
 year = {2016}
}



@article{DBLP:journals/pieee/FragouliPCD15,
 author = {Christina Fragouli and
Vinod M. Prabhakaran and
L{\'{a}}szl{\'{o}} Czap and
Suhas N. Diggavi},
 bibsource = {dblp computer science bibliography, http://dblp.org},
 biburl = {http://dblp.uni-trier.de/rec/bib/journals/pieee/FragouliPCD15},
 file = {:papers:winetsec_boe.pdf},
 journal = {Proceedings of the IEEE},
 number = {10},
 pages = {1826--1840},
 tags = {journal,WiNetSec,IT},
 timestamp = {Tue, 22 Sep 2015 10:37:29 +0200},
 title = {Wireless Network Security: Building on Erasures},
 type = {2},
 doi = {http://dx.doi.org/10.1109/JPROC.2015.2438312},
 volume = {103},
 year = {2015}
}



@article{DBLP:journals/tit/CzapPFD15,
 abstract = {We consider a 1-to-K communication scenario, where a source transmits private messages to K receivers through a broadcast erasure channel, and the receivers feed back strictly causally and publicly their channel states after each transmission. We explore the achievable rate region when we require that the message to each receiver remains secret - in the information theoretical sense - from all the other receivers. We characterize the capacity of secure communication in all the cases where the capacity of the 1-to-K communication scenario without the requirement of security is known. As a special case, we characterize the secret-message capacity of a single receiver point-to-point erasure channel with public state-feedback in the presence of a passive eavesdropper. 
We find that in all cases where we have an exact characterization, we can achieve the capacity by using linear complexity two-phase schemes: in the first phase we create appropriate secret keys, and in the second phase we use them to encrypt each message. We find that the amount of key we need is smaller than the size of the message, and equal to the amount of encrypted message the potential eavesdroppers jointly collect. Moreover, we prove that a dishonest receiver that provides deceptive feedback cannot diminish the rate experienced by the honest receivers. 
We also develop a converse proof which reflects the two-phase structure of our achievability scheme. As a side result, our technique leads to a new outer bound proof for the non-secure communication problem.},
 author = {L{\'{a}}szl{\'{o}} Czap and
Vinod M. Prabhakaran and
Christina Fragouli and
Suhas N. Diggavi},
 bibsource = {dblp computer science bibliography, http://dblp.org},
 biburl = {http://dblp.uni-trier.de/rec/bib/journals/tit/CzapPFD15},
 doi = {10.1109/TIT.2015.2449838},
 file = {:papers:SecretCom_Czap.pdf},
 journal = {IEEE Transactions on Information Theory},
 number = {9},
 pages = {4788--4808},
 tags = {journal,WiNetSec,IT},
 timestamp = {Thu, 20 Aug 2015 14:54:38 +0200},
 title = {Secret Communication Over Broadcast Erasure Channels With State-Feedback},
 type = {2},
 url_arxiv = {https://arxiv.org/abs/1408.1800},
 volume = {61},
 year = {2015}
}



@article{karmoose2019using,
 abstract = {The fact that millimeter-wave (mmWave) communication needs to be directional is usually perceived as a challenge; in this letter, we argue that it enables efficient secret key sharing that is unconditionally secure from passive eavesdroppers by building on packet erasures. We showcase the potential of our approach in two setups: 5G networks and vehicle platooning. In both cases, with the right choice of parameters, we can potentially establish keys in the order of tenths of Mb/s. These first results are based on some simplifying assumptions, yet we believe that they give incentives to further explore such techniques.},
 author = {Karmoose, Mohammed and Fragouli, Christina and Diggavi, Suhas and Misoczki, Rafael and Yang, Lily L and Zhang, Zhenliang},
 journal = {IEEE Communications Letters},
 number = {6},
 pages = {1077--1080},
 publisher = {IEEE},
 tags = {journal,WNS,WiNetnew},
 title = {Using mm-waves for secret key establishment},
 type = {2},
 doi = {10.1109/LCOMM.2019.2909918},
 volume = {23},
 year = {2019}
}



@article{kdw_j11,
 abstract = {We study the secret-key capacity in a joint source-channel coding setup-the terminals are connected over a discrete memoryless channel and have access to side information, modelled as a pair of discrete memoryless source sequences. As our main result, we establish the upper and lower bounds on the secret-key capacity. In the lower bound expression, the equivocation terms of the source and channel components are functionally additive even though the coding scheme generates a single secret-key by jointly taking into account the source and channel equivocations. Our bounds coincide, thus establishing the capacity, when the underlying wiretap channel can be decomposed into a set of independent, parallel, and reversely degraded channels. For the case of parallel Gaussian channels and jointly Gaussian sources we show that Gaussian codebooks achieve the secret-key capacity. In addition, when the eavesdropper also observes a correlated side information sequence, we establish the secret-key capacity when both the source and channel of the eavesdropper are a degraded version of the legitimate receiver. We finally also treat the case when a public discussion channel is available, propose a separation based coding scheme, and establish its optimality when the channel output symbols of the legitimate receiver and eavesdropper are conditionally independent given the input.},
 author = {Khisti, A and Diggavi, S.N. and Wornell, Gregory W.},
 doi = {10.1109/TIT.2011.2173629},
 file = {:papers:secret_keygen.pdf},
 issn = {0018-9448},
 journal = {Information Theory, IEEE Transactions on},
 label = {kdw_j11},
 month = {Feb},
 number = {2},
 pages = {652-670},
 tags = {journal,ITsecrecy,KeyGen,IT,WiNetSec,SrcChanSec},
 title = {Secret-Key Generation Using Correlated Sources and Channels},
 type = {2},
 volume = {58},
 year = {2012}
}



@inproceedings{KDWj08,
 author = {A. Khisti and S N. Diggavi and G W. Wornell,},
 booktitle = {IEEE International Symposium on Information Theory (ISIT), Toronto, Canada},
 month = {July},
 note = {},
 pages = {1005--1009},
 tags = {conf,ITsecrecy,KeyGen,IT,WiNetSec,SrcChanSec},
 title = {Secret key generation with correlated sources and noisy channels},
 type = {4},
 year = {2008}
}



@article{KDWj10,
 author = {A. Khisti and S N. Diggavi and G W. Wornell},
 journal = {IEEE Transactions  on Information Forensics and Security},
 month = {Sep},
 note = {},
 pages = {672-681},
 tags = {journal,ITsecrecy,KeyGen,IT,WiNetSec},
 title = {Secret-key agreement over wiretap channels with random state parameters},
 type = {2},
 url_arxiv = {http://arxiv.org/abs/1009.3052},
 volume = {6},
 year = {2011}
}



@inproceedings{KTWj09,
 author = {A. Khisti and S N. Diggavi and G W. Wornell},
 booktitle = {IEEE International Symposium on Information Theory (ISIT), Seoul, Korea},
 month = {June},
 note = {},
 pages = {2286--2290},
 tags = {conf,ITsecrecy,KeyGen,IT,WiNetSec},
 title = {Secret key agreement using asymmetry in channel state knowledge},
 type = {4},
 year = {2009}
}



@inproceedings{mishra2015oblivious,
 author = {Mishra, Manoj and Dey, Bikash Kumar and Prabhakaran, Vinod M and Diggavi, Suhas},
 booktitle = {2015 IEEE International Symposium on Information Theory (ISIT)},
 organization = {IEEE},
 pages = {1169--1173},
 tags = {conf,IT,WNS},
 title = {On the oblivious transfer capacity of the degraded wiretapped binary erasure channel},
 type = {4},
 year = {2015}
}



@article{mishra2017wiretapped,
 author = {Mishra, Manoj and Dey, Bikash Kumar and Prabhakaran, Vinod M and Diggavi, Suhas N},
 journal = {IEEE Transactions on Information Theory},
 number = {4},
 pages = {2560--2595},
 publisher = {IEEE},
 tags = {journal,IT,WNS},
 title = {Wiretapped Oblivious Transfer},
 type = {2},
 volume = {63},
 year = {2017}
}



@inproceedings{mishradey14,
 author = {Mishra, M. and Dey, B. and Prabhakaran, V. and Diggavi, S.N.},
 booktitle = {IEEE Information Theory Workshop (ITW) 2014},
 file = {:papers:isit14_mdpd.pdf},
 month = {Nov},
 tags = {conf,IT,WiNetSec},
 title = {On the oblivious transfer capacity region of the binary erasure broadcast channel},
 type = {4},
 year = {2014}
}



@inproceedings{PDTc09d,
 abstract = {This paper studies the idea of noise insertion by authenticated relays through friendly jamming. We develop the secrecy rate achievable in arbitrary (deterministic) networks when there are relays actively helping secrecy.},
 author = {E. Perron and S N. Diggavi and E. Telatar,},
 booktitle = {Information Theory and Applications workshop (ITA), UCSD, San Diego, California},
 file = {:papers:pdtita09final.pdf},
 label = {pdtc09d},
 month = {February},
 note = {},
 pages = {77--84},
 tags = {conf,ITsecrecy,IT,WiNetSec,WiNetInfFlow,ITapprox,WiNet},
 title = {On noise insertion strategies for wireless network secrecy},
 type = {4},
 year = {2009}
}



@inproceedings{PDTj08,
 abstract = {We study a line network with an eavesdropper having access to the
relay transmission. We assume that there could also be a public feedback channel from the destination. We develop achievable strategies to achieve certain rate-equivocation pairs.},
 author = {E. Perron and S N. Diggavi and E. Telatar},
 booktitle = {Proceedings of Allerton Conference on Communication, Control, and Computing, Illinois},
 file = {:papers:pdt_allerton08.pdf},
 month = {September},
 note = {},
 pages = {753--760},
 tags = {conf,ITsecrecy,IT,WiNetSec,WiNetInfFlow,WiNet,InteractiveSec,SelConf},
 title = {Wireless network secrecy with public feedback},
 type = {4},
 year = {2008}
}



@inproceedings{PDTp09,
 abstract = {In this paper we consider
secret communication between two special nodes (“source” and
“destination”) in a wireless network with authenticated relays:
the message communicated to the destination is to be kept
information-theoretically (unconditionally) secret from any eavesdropper
within a class. Since the transmissions are broadcast and
interfere with each other, complex signal interactions occur. We
develop cooperative schemes which utilize these interactions in
wireless communication over networks with arbitrary topology,
and give provable unconditional secrecy guarantees.},
 author = {E. Perron and S N. Diggavi and I E. Telatar},
 booktitle = {IEEE INFOCOM 2009, Rio de Janeiro, Brazil},
 file = {:papers:pdtwireless_net_secrecy08.pdf},
 label = {pdt_c09a},
 month = {April},
 note = {},
 pages = {},
 tags = {conf,ITsecrecy,IT,WiNetSec,WiNetInfFlow,WiNet,SelConf},
 title = {On cooperative wireless network secrecy},
 type = {4},
 year = {2009}
}



@inproceedings{PDTp09a,
 abstract = {The compound wiretap channel generalizes the
classical problem in broadcast information-theoretic secrecy by
allowing a class of potential eavesdroppers. In this paper we
present a new coding scheme that generalizes known approaches
to this problem. The scheme prefixes an artificial multiple
access channel to the transmission scheme in order to design a
structured transmit codebook. The idea is that such a structure
can potentially increase the perfect secrecy rate for the legitimate
users in the presence of the class of eavesdroppers.},
 author = {E. Perron and S N. Diggavi and I E. Telatar},
 booktitle = {IEEE Information Theory Workshop (ITW), Taormina, Italy},
 file = {:papers:pdt09mac_wiretap.pdf},
 month = {October},
 note = {},
 pages = {11--15},
 tags = {conf,ITsecrecy,IT,WiNetSec,SelConf},
 title = {A multiple access approach for the compound wiretap channel},
 type = {4},
 year = {2009}
}



@inproceedings{safaka2012creating,
 abstract = {Current security systems typically rely on the adversary's computational limitations (e.g., the fact that it cannot invert a hash function or perform large-integer factorization). Wireless networks offer the opportunity for a different, complementary kind of security, which relies not on the adversary's computational limitations, but on its limited network presence (i.e., that the adversary cannot be located at many different points in the network at the same time). We take a first step toward designing and building a wireless security system that leverages this opportunity: We consider the problem where a group of n nodes, connected to the same broadcast wireless network, want to agree on a shared secret (e.g., an encryption key), in the presence of an adversary Eve who tries to listen in and steal the secret. We propose a secret-agreement protocol, where the n nodes of the group keep exchanging bits until they have all agreed on a bit sequence that Eve cannot reconstruct (with very high probability). We provide experimental evidence---to the best of our knowledge, the first one---that a group of wireless nodes can generate thousands of new shared secret bits per second, with their secrecy being independent of the adversary's computational capabilities.},
 author = {Safaka, Iris and Fragouli, Christina and Argyraki, Katerina and Diggavi, Suhas},
 booktitle = {Proceedings of the 11th ACM Workshop on Hot Topics in Networks},
 file = {:papers:secrets_thin_air.pdf},
 month = {Oct},
 organization = {ACM},
 pages = {73--78},
 tags = {conf,WiNetSec,IT},
 title = {Creating shared secrets out of thin air},
 type = {4},
 year = {2012}
}



@article{siavoshani2017multi,
 author = {Siavoshani, Mahdi Jafari and Mishra, Shaunak and Fragouli, Christina and Diggavi, Suhas N},
 file = {:papers:siavoshani_secretkey.pdf},
 journal = {IEEE Transactions on Information Forensics and Security},
 number = {2},
 pages = {323--337},
 publisher = {IEEE},
 tags = {journal,IT,WiNetSec},
 title = {Multi-Party Secret Key Agreement Over State-Dependent Wireless Broadcast Channels},
 type = {2},
 volume = {12},
 year = {2017}
}

\">\n            <i class=\"fa fa-download fa-fw\"></i> Download BibTeX\n          </a>\n        </li>\n        <li>\n          <a href=\"//bibbase.org/rss?bib=https://research.seas.ucla.edu/licos/files/2023/02/publicactions_v1.bib\">\n            <i class=\"fa fa-rss fa-fw\"></i> RSS Feed\n          </a>\n          </li>\n      </ul>\n      </li>\n\n      \n\n\n      \n    </ul>\n\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_embed\"\n         style=\"display: none;\">\n\n      Excellent! Next you can\n      <a href=\"/network/register?next=/network/newSiteFromTemplate%3Fbiburl=https://research.seas.ucla.edu/licos/files/2023/02/publicactions_v1.bib\"\n      >create a new website with this list</a>, or\n      embed it in an existing web page by copying &amp; pasting\n      any of the following snippets.\n\n      <div style=\"text-align: left; margin-top: 1em;\">\n        <strong>JavaScript</strong>\n        <span class=\"comment recommended\">(easiest)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fresearch.seas.ucla.edu%2Flicos%2Ffiles%2F2023%2F02%2Fpublicactions_v1.bib&amp;authorFirst=1&amp;nocache=1&amp;fullnames=1&amp;theme=bullets&amp;group0=year&amp;group1=type&amp;owner={}&amp;filter=tags:(WNS|ITSecrecy|WiNetSec)&amp;jsonp=1&amp;jsonp=1\"&gt;&lt;/script&gt;\n          </code>\n        </div>\n\n        <strong>PHP</strong>\n        <div class=\"well well-small\">\n          <code>\n            &lt;?php\n            $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fresearch.seas.ucla.edu%2Flicos%2Ffiles%2F2023%2F02%2Fpublicactions_v1.bib&amp;authorFirst=1&amp;nocache=1&amp;fullnames=1&amp;theme=bullets&amp;group0=year&amp;group1=type&amp;owner={}&amp;filter=tags:(WNS|ITSecrecy|WiNetSec)&amp;jsonp=1\");\n            print_r($contents);\n            ?&gt;\n          </code>\n        </div>\n\n        <strong>iFrame</strong>\n        <span class=\"comment\">(not recommended)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fresearch.seas.ucla.edu%2Flicos%2Ffiles%2F2023%2F02%2Fpublicactions_v1.bib&amp;authorFirst=1&amp;nocache=1&amp;fullnames=1&amp;theme=bullets&amp;group0=year&amp;group1=type&amp;owner={}&amp;filter=tags:(WNS|ITSecrecy|WiNetSec)&amp;jsonp=1\"&gt;&lt;/iframe&gt;\n          </code>\n        </div>\n\n        <p>\n          For more details see the <a href=\"//bibbase.org/help\">documention</a>.\n        </p>\n      </div>\n    </div>\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_preview\"\n         style=\"display: none;\">\n\n      This is a preview! To use this list on your own web site\n      or create a new web site from it,\n      <a href=\"/network/register?next=/network/newAccountWithFile%3FfileId=\"\n      >create a free account</a>. The file will be added\n      and you will be able to edit it in the File Manager.\n      We will show you instructions once you've created your account.\n    </div>\n\n    <div class=\"alert alert-warning bibbase_msg\" id=\"bibbase_msg_mendeley1\"\n         style=\"display: none;\">\n\n      <p>To the site owner:</p>\n\n      <p><strong>Action required!</strong> Mendeley is changing its\n        API. In order to keep using Mendeley with BibBase past April\n        14th, you need to:\n        <ol>\n          <li>renew the authorization for BibBase on Mendeley, and</li>\n          <li>update the BibBase URL\n            in your page the same way you did when you initially set up\n            this page.\n          </li>\n        </ol>\n      </p>\n\n      <p>\n        <a href=\"http://bibbase.org/cgi-bin/mendeley2/get.py\">\n          <i class=\"fa fa-angle-double-right\"></i>\n          Fix it now</a>\n      </p>\n    </div>\n\n  </div>\n\n\n  <div id=\"bibbase_body\">\n    \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2019\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2019')\"\n      onkeypress=\"toggleGroup('group_2019')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2019</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"karmoose-fragouli-diggavi-misoczki-yang-zhang-usingmmwavesforsecretkeyestablishment-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Mohammed Karmoose;  Christina Fragouli;  Suhas Diggavi;  Rafael Misoczki;  Lily L Yang;  and  Zhenliang Zhang.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Using mm-waves for secret key establishment.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Communications Letters</i>, 23(6): 1077–1080.  2019.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/LCOMM.2019.2909918\"\n     onclick=\"log_download('karmoose-fragouli-diggavi-misoczki-yang-zhang-usingmmwavesforsecretkeyestablishment-2019', 'http://doi.org/10.1109/LCOMM.2019.2909918', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/karmoose-fragouli-diggavi-misoczki-yang-zhang-usingmmwavesforsecretkeyestablishment-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('karmoose-fragouli-diggavi-misoczki-yang-zhang-usingmmwavesforsecretkeyestablishment-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{karmoose2019using,\n abstract = {The fact that millimeter-wave (mmWave) communication needs to be directional is usually perceived as a challenge; in this letter, we argue that it enables efficient secret key sharing that is unconditionally secure from passive eavesdroppers by building on packet erasures. We showcase the potential of our approach in two setups: 5G networks and vehicle platooning. In both cases, with the right choice of parameters, we can potentially establish keys in the order of tenths of Mb/s. These first results are based on some simplifying assumptions, yet we believe that they give incentives to further explore such techniques.},\n author = {Karmoose, Mohammed and Fragouli, Christina and Diggavi, Suhas and Misoczki, Rafael and Yang, Lily L and Zhang, Zhenliang},\n journal = {IEEE Communications Letters},\n number = {6},\n pages = {1077--1080},\n publisher = {IEEE},\n tags = {journal,WNS,WiNetnew},\n title = {Using mm-waves for secret key establishment},\n type = {2},\n doi = {10.1109/LCOMM.2019.2909918},\n volume = {23},\n year = {2019}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The fact that millimeter-wave (mmWave) communication needs to be directional is usually perceived as a challenge; in this letter, we argue that it enables efficient secret key sharing that is unconditionally secure from passive eavesdroppers by building on packet erasures. We showcase the potential of our approach in two setups: 5G networks and vehicle platooning. In both cases, with the right choice of parameters, we can potentially establish keys in the order of tenths of Mb/s. These first results are based on some simplifying assumptions, yet we believe that they give incentives to further explore such techniques.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2017\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2017')\"\n      onkeypress=\"toggleGroup('group_2017')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2017</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"mishra-dey-prabhakaran-diggavi-wiretappedoblivioustransfer-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Manoj Mishra;  Bikash Kumar Dey;  Vinod M Prabhakaran;  and  Suhas N Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Wiretapped Oblivious Transfer.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>, 63(4): 2560–2595.  2017.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/mishra-dey-prabhakaran-diggavi-wiretappedoblivioustransfer-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('mishra-dey-prabhakaran-diggavi-wiretappedoblivioustransfer-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{mishra2017wiretapped,\n author = {Mishra, Manoj and Dey, Bikash Kumar and Prabhakaran, Vinod M and Diggavi, Suhas N},\n journal = {IEEE Transactions on Information Theory},\n number = {4},\n pages = {2560--2595},\n publisher = {IEEE},\n tags = {journal,IT,WNS},\n title = {Wiretapped Oblivious Transfer},\n type = {2},\n volume = {63},\n year = {2017}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"siavoshani-mishra-fragouli-diggavi-multipartysecretkeyagreementoverstatedependentwirelessbroadcastchannels-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Mahdi Jafari Siavoshani;  Shaunak Mishra;  Christina Fragouli;  and  Suhas N Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Multi-Party Secret Key Agreement Over State-Dependent Wireless Broadcast Channels.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Forensics and Security</i>, 12(2): 323–337.  2017.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/siavoshani-mishra-fragouli-diggavi-multipartysecretkeyagreementoverstatedependentwirelessbroadcastchannels-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('siavoshani-mishra-fragouli-diggavi-multipartysecretkeyagreementoverstatedependentwirelessbroadcastchannels-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{siavoshani2017multi,\n author = {Siavoshani, Mahdi Jafari and Mishra, Shaunak and Fragouli, Christina and Diggavi, Suhas N},\n file = {:papers:siavoshani_secretkey.pdf},\n journal = {IEEE Transactions on Information Forensics and Security},\n number = {2},\n pages = {323--337},\n publisher = {IEEE},\n tags = {journal,IT,WiNetSec},\n title = {Multi-Party Secret Key Agreement Over State-Dependent Wireless Broadcast Channels},\n type = {2},\n volume = {12},\n year = {2017}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2016\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2016')\"\n      onkeypress=\"toggleGroup('group_2016')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2016</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"czap-prabhakaran-fragouli-diggavi-anlpcharacterizationofthesecretmessagecapacityofthreeerasurenetworkswithfeedback-2016\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   László Czap;  Vinod M Prabhakaran;  Christina Fragouli;  and  Suhas N Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  An LP Characterization of the Secret-message Capacity of Three Erasure Networks With Feedback.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>, 62(5): 2430–2480.  2016.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/czap-prabhakaran-fragouli-diggavi-anlpcharacterizationofthesecretmessagecapacityofthreeerasurenetworkswithfeedback-2016\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('czap-prabhakaran-fragouli-diggavi-anlpcharacterizationofthesecretmessagecapacityofthreeerasurenetworkswithfeedback-2016')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{czap2016lp,\n author = {Czap, L{\\&#x27;a}szl{\\&#x27;o} and Prabhakaran, Vinod M and Fragouli, Christina and Diggavi, Suhas N},\n journal = {IEEE Transactions on Information Theory},\n number = {5},\n pages = {2430--2480},\n publisher = {IEEE},\n tags = {journal,IT,WNS},\n title = {An LP Characterization of the Secret-message Capacity of Three Erasure Networks With Feedback},\n type = {2},\n volume = {62},\n year = {2016}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2015\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2015')\"\n      onkeypress=\"toggleGroup('group_2015')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2015</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"czap-fragouli-prabhakaran-diggavi-securenetworkcodingwitherasuresandfeedback-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   László Czap;  Christina Fragouli;  Vinod M Prabhakaran;  and  Suhas Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Secure network coding with erasures and feedback.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>, 61(4): 1667–1686.  2015.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/http://dx.doi.org/10.1109/TIT.2015.2402272\"\n     onclick=\"log_download('czap-fragouli-prabhakaran-diggavi-securenetworkcodingwitherasuresandfeedback-2015', 'http://doi.org/http://dx.doi.org/10.1109/TIT.2015.2402272', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/czap-fragouli-prabhakaran-diggavi-securenetworkcodingwitherasuresandfeedback-2015\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('czap-fragouli-prabhakaran-diggavi-securenetworkcodingwitherasuresandfeedback-2015')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{czap2015secure,\n author = {Czap, L{\\&#x27;a}szl{\\&#x27;o} and Fragouli, Christina and Prabhakaran, Vinod M and Diggavi, Suhas},\n journal = {IEEE Transactions on Information Theory},\n number = {4},\n pages = {1667--1686},\n publisher = {IEEE},\n tags = {journal,IT,WNS},\n title = {Secure network coding with erasures and feedback},\n type = {2},\n doi = {http://dx.doi.org/10.1109/TIT.2015.2402272},\n volume = {61},\n year = {2015}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"fragouli-prabhakaran-czap-diggavi-wirelessnetworksecuritybuildingonerasures-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Christina Fragouli;  Vinod M. Prabhakaran;  László Czap;  and  Suhas N. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Wireless Network Security: Building on Erasures.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Proceedings of the IEEE</i>, 103(10): 1826–1840.  2015.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/http://dx.doi.org/10.1109/JPROC.2015.2438312\"\n     onclick=\"log_download('fragouli-prabhakaran-czap-diggavi-wirelessnetworksecuritybuildingonerasures-2015', 'http://doi.org/http://dx.doi.org/10.1109/JPROC.2015.2438312', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-prabhakaran-czap-diggavi-wirelessnetworksecuritybuildingonerasures-2015\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-prabhakaran-czap-diggavi-wirelessnetworksecuritybuildingonerasures-2015')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{DBLP:journals/pieee/FragouliPCD15,\n author = {Christina Fragouli and\nVinod M. Prabhakaran and\nL{\\&#x27;{a}}szl{\\&#x27;{o}} Czap and\nSuhas N. Diggavi},\n bibsource = {dblp computer science bibliography, http://dblp.org},\n biburl = {http://dblp.uni-trier.de/rec/bib/journals/pieee/FragouliPCD15},\n file = {:papers:winetsec_boe.pdf},\n journal = {Proceedings of the IEEE},\n number = {10},\n pages = {1826--1840},\n tags = {journal,WiNetSec,IT},\n timestamp = {Tue, 22 Sep 2015 10:37:29 +0200},\n title = {Wireless Network Security: Building on Erasures},\n type = {2},\n doi = {http://dx.doi.org/10.1109/JPROC.2015.2438312},\n volume = {103},\n year = {2015}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"czap-prabhakaran-fragouli-diggavi-secretcommunicationoverbroadcasterasurechannelswithstatefeedback-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   László Czap;  Vinod M. Prabhakaran;  Christina Fragouli;  and  Suhas N. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://arxiv.org/abs/1408.1800\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'czap-prabhakaran-fragouli-diggavi-secretcommunicationoverbroadcasterasurechannelswithstatefeedback-2015', 'https://arxiv.org/abs/1408.1800', event);\">\n    Secret Communication Over Broadcast Erasure Channels With State-Feedback.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>, 61(9): 4788–4808.  2015.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://arxiv.org/abs/1408.1800\"\n     onclick=\"log_download('czap-prabhakaran-fragouli-diggavi-secretcommunicationoverbroadcasterasurechannelswithstatefeedback-2015', 'https://arxiv.org/abs/1408.1800', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Secret Communication Over Broadcast Erasure Channels With State-Feedback [link]\"\n       title=\" arxiv\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> arxiv</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1109/TIT.2015.2449838\"\n     onclick=\"log_download('czap-prabhakaran-fragouli-diggavi-secretcommunicationoverbroadcasterasurechannelswithstatefeedback-2015', 'http://doi.org/10.1109/TIT.2015.2449838', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/czap-prabhakaran-fragouli-diggavi-secretcommunicationoverbroadcasterasurechannelswithstatefeedback-2015\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('czap-prabhakaran-fragouli-diggavi-secretcommunicationoverbroadcasterasurechannelswithstatefeedback-2015')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{DBLP:journals/tit/CzapPFD15,\n abstract = {We consider a 1-to-K communication scenario, where a source transmits private messages to K receivers through a broadcast erasure channel, and the receivers feed back strictly causally and publicly their channel states after each transmission. We explore the achievable rate region when we require that the message to each receiver remains secret - in the information theoretical sense - from all the other receivers. We characterize the capacity of secure communication in all the cases where the capacity of the 1-to-K communication scenario without the requirement of security is known. As a special case, we characterize the secret-message capacity of a single receiver point-to-point erasure channel with public state-feedback in the presence of a passive eavesdropper. \nWe find that in all cases where we have an exact characterization, we can achieve the capacity by using linear complexity two-phase schemes: in the first phase we create appropriate secret keys, and in the second phase we use them to encrypt each message. We find that the amount of key we need is smaller than the size of the message, and equal to the amount of encrypted message the potential eavesdroppers jointly collect. Moreover, we prove that a dishonest receiver that provides deceptive feedback cannot diminish the rate experienced by the honest receivers. \nWe also develop a converse proof which reflects the two-phase structure of our achievability scheme. As a side result, our technique leads to a new outer bound proof for the non-secure communication problem.},\n author = {L{\\&#x27;{a}}szl{\\&#x27;{o}} Czap and\nVinod M. Prabhakaran and\nChristina Fragouli and\nSuhas N. Diggavi},\n bibsource = {dblp computer science bibliography, http://dblp.org},\n biburl = {http://dblp.uni-trier.de/rec/bib/journals/tit/CzapPFD15},\n doi = {10.1109/TIT.2015.2449838},\n file = {:papers:SecretCom_Czap.pdf},\n journal = {IEEE Transactions on Information Theory},\n number = {9},\n pages = {4788--4808},\n tags = {journal,WiNetSec,IT},\n timestamp = {Thu, 20 Aug 2015 14:54:38 +0200},\n title = {Secret Communication Over Broadcast Erasure Channels With State-Feedback},\n type = {2},\n url_arxiv = {https://arxiv.org/abs/1408.1800},\n volume = {61},\n year = {2015}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider a 1-to-K communication scenario, where a source transmits private messages to K receivers through a broadcast erasure channel, and the receivers feed back strictly causally and publicly their channel states after each transmission. We explore the achievable rate region when we require that the message to each receiver remains secret - in the information theoretical sense - from all the other receivers. We characterize the capacity of secure communication in all the cases where the capacity of the 1-to-K communication scenario without the requirement of security is known. As a special case, we characterize the secret-message capacity of a single receiver point-to-point erasure channel with public state-feedback in the presence of a passive eavesdropper. We find that in all cases where we have an exact characterization, we can achieve the capacity by using linear complexity two-phase schemes: in the first phase we create appropriate secret keys, and in the second phase we use them to encrypt each message. We find that the amount of key we need is smaller than the size of the message, and equal to the amount of encrypted message the potential eavesdroppers jointly collect. Moreover, we prove that a dishonest receiver that provides deceptive feedback cannot diminish the rate experienced by the honest receivers. We also develop a converse proof which reflects the two-phase structure of our achievability scheme. As a side result, our technique leads to a new outer bound proof for the non-secure communication problem.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"mishra-dey-prabhakaran-diggavi-ontheoblivioustransfercapacityofthedegradedwiretappedbinaryerasurechannel-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Manoj Mishra;  Bikash Kumar Dey;  Vinod M Prabhakaran;  and  Suhas Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On the oblivious transfer capacity of the degraded wiretapped binary erasure channel.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>2015 IEEE International Symposium on Information Theory (ISIT)</i>, pages 1169–1173,  2015. IEEE\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/mishra-dey-prabhakaran-diggavi-ontheoblivioustransfercapacityofthedegradedwiretappedbinaryerasurechannel-2015\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('mishra-dey-prabhakaran-diggavi-ontheoblivioustransfercapacityofthedegradedwiretappedbinaryerasurechannel-2015')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{mishra2015oblivious,\n author = {Mishra, Manoj and Dey, Bikash Kumar and Prabhakaran, Vinod M and Diggavi, Suhas},\n booktitle = {2015 IEEE International Symposium on Information Theory (ISIT)},\n organization = {IEEE},\n pages = {1169--1173},\n tags = {conf,IT,WNS},\n title = {On the oblivious transfer capacity of the degraded wiretapped binary erasure channel},\n type = {4},\n year = {2015}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2014\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2014')\"\n      onkeypress=\"toggleGroup('group_2014')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2014</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"czap-prabhakaran-diggavi-fragouli-trianglenetworksecrecy-2014\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Czap;  V.M. Prabhakaran;  S. Diggavi;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Triangle network secrecy.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Information Theory (ISIT), 2014 IEEE International Symposium on</i>, pages 781-785, June 2014. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/ISIT.2014.6874939\"\n     onclick=\"log_download('czap-prabhakaran-diggavi-fragouli-trianglenetworksecrecy-2014', 'http://doi.org/10.1109/ISIT.2014.6874939', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/czap-prabhakaran-diggavi-fragouli-trianglenetworksecrecy-2014\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('czap-prabhakaran-diggavi-fragouli-trianglenetworksecrecy-2014')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{6874939,\n abstract = {We characterize the secret message capacity of the triangle network, that consists of a source, a relay and a destination connected through orthogonal erasure channels. A passive eavesdropper, Eve, wiretaps any one of the three channels. The source and the relay can each generate unlimited private randomness; the relay and the destination can publicly provide strictly causal channel state information. Our achievable scheme is expressed through a linear program (LP) with 11 inequalities that captures a minimal set of secret key generation methods and the use of them for message encryption. Our outer bound is expressed also through a linear program, in this case with 41 constraints, constructed from general information inequalities. We prove that the optimal value of the outer bound LP is no larger than that of the scheme LP, which implies that the solution of the achievable scheme LP is the capacity. We find that equipping the relay with private randomness increases the secrecy rate by more than 40\\% in some cases and that cut-set bounds, directly applied in the network, are not always tight. Because the derivation of the inner and outer bound are both lengthy, we describe in this paper the achievability scheme, outline the outer bound, and provide the full derivations online [1]. We also make available Matlab functions that take as input the erasure probabilities and evaluate the inner and outer bounds.},\n author = {Czap, L. and Prabhakaran, V.M. and Diggavi, S. and Fragouli, C.},\n booktitle = {Information Theory (ISIT), 2014 IEEE International Symposium on},\n doi = {10.1109/ISIT.2014.6874939},\n file = {:papers:tri_net_sec.pdf},\n month = {June},\n pages = {781-785},\n tags = {conf,WiNetSec,IT},\n title = {Triangle network secrecy},\n type = {4},\n year = {2014}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We characterize the secret message capacity of the triangle network, that consists of a source, a relay and a destination connected through orthogonal erasure channels. A passive eavesdropper, Eve, wiretaps any one of the three channels. The source and the relay can each generate unlimited private randomness; the relay and the destination can publicly provide strictly causal channel state information. Our achievable scheme is expressed through a linear program (LP) with 11 inequalities that captures a minimal set of secret key generation methods and the use of them for message encryption. Our outer bound is expressed also through a linear program, in this case with 41 constraints, constructed from general information inequalities. We prove that the optimal value of the outer bound LP is no larger than that of the scheme LP, which implies that the solution of the achievable scheme LP is the capacity. We find that equipping the relay with private randomness increases the secrecy rate by more than 40% in some cases and that cut-set bounds, directly applied in the network, are not always tight. Because the derivation of the inner and outer bound are both lengthy, we describe in this paper the achievability scheme, outline the outer bound, and provide the full derivations online [1]. We also make available Matlab functions that take as input the erasure probabilities and evaluate the inner and outer bounds.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"mishra-dey-prabhakaran-diggavi-theoblivioustransfercapacityofthewiretappedbinaryerasurechannel-2014\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   M. Mishra;  B.K. Dey;  V.M. Prabhakaran;  and  S. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://arxiv.org/abs/1404.6614\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'mishra-dey-prabhakaran-diggavi-theoblivioustransfercapacityofthewiretappedbinaryerasurechannel-2014', 'http://arxiv.org/abs/1404.6614', event);\">\n    The oblivious transfer capacity of the wiretapped binary erasure channel.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Information Theory (ISIT), 2014 IEEE International Symposium on</i>, pages 1539-1543, June 2014. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://arxiv.org/abs/1404.6614\"\n     onclick=\"log_download('mishra-dey-prabhakaran-diggavi-theoblivioustransfercapacityofthewiretappedbinaryerasurechannel-2014', 'http://arxiv.org/abs/1404.6614', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"The oblivious transfer capacity of the wiretapped binary erasure channel [link]\"\n       title=\" arxiv\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> arxiv</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1109/ISIT.2014.6875091\"\n     onclick=\"log_download('mishra-dey-prabhakaran-diggavi-theoblivioustransfercapacityofthewiretappedbinaryerasurechannel-2014', 'http://doi.org/10.1109/ISIT.2014.6875091', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/mishra-dey-prabhakaran-diggavi-theoblivioustransfercapacityofthewiretappedbinaryerasurechannel-2014\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('mishra-dey-prabhakaran-diggavi-theoblivioustransfercapacityofthewiretappedbinaryerasurechannel-2014')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{6875091,\n abstract = {We consider oblivious transfer between Alice and Bob in the presence of an eavesdropper Eve when there is a broadcast channel from Alice to Bob and Eve. In addition to the secrecy constraints of Alice and Bob, Eve should not learn the private data of Alice and Bob. When the broadcast channel consists of two independent binary erasure channels, we derive the oblivious transfer capacity for both 2-privacy (where the eavesdropper may collude with either party) and 1-privacy (where there are no collusions).},\n author = {Mishra, M. and Dey, B.K. and Prabhakaran, V.M. and Diggavi, S.},\n booktitle = {Information Theory (ISIT), 2014 IEEE International Symposium on},\n doi = {10.1109/ISIT.2014.6875091},\n month = {June},\n pages = {1539-1543},\n tags = {conf,IT,WiNetSec},\n title = {The oblivious transfer capacity of the wiretapped binary erasure channel},\n type = {4},\n url_arxiv = {http://arxiv.org/abs/1404.6614},\n year = {2014}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider oblivious transfer between Alice and Bob in the presence of an eavesdropper Eve when there is a broadcast channel from Alice to Bob and Eve. In addition to the secrecy constraints of Alice and Bob, Eve should not learn the private data of Alice and Bob. When the broadcast channel consists of two independent binary erasure channels, we derive the oblivious transfer capacity for both 2-privacy (where the eavesdropper may collude with either party) and 1-privacy (where there are no collusions).\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"mishra-dey-prabhakaran-diggavi-ontheoblivioustransfercapacityregionofthebinaryerasurebroadcastchannel-2014\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   M. Mishra;  B. Dey;  V. Prabhakaran;  and  S.N. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On the oblivious transfer capacity region of the binary erasure broadcast channel.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Information Theory Workshop (ITW) 2014</i>, Nov 2014. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/mishra-dey-prabhakaran-diggavi-ontheoblivioustransfercapacityregionofthebinaryerasurebroadcastchannel-2014\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('mishra-dey-prabhakaran-diggavi-ontheoblivioustransfercapacityregionofthebinaryerasurebroadcastchannel-2014')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{mishradey14,\n author = {Mishra, M. and Dey, B. and Prabhakaran, V. and Diggavi, S.N.},\n booktitle = {IEEE Information Theory Workshop (ITW) 2014},\n file = {:papers:isit14_mdpd.pdf},\n month = {Nov},\n tags = {conf,IT,WiNetSec},\n title = {On the oblivious transfer capacity region of the binary erasure broadcast channel},\n type = {4},\n year = {2014}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2013\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2013')\"\n      onkeypress=\"toggleGroup('group_2013')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2013</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (6)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"safaka-fragouli-argyraki-diggavi-exchangingpairwisesecretsefficiently-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   I Safaka;  C. Fragouli;  K. Argyraki;  and  S. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Exchanging pairwise secrets efficiently.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>INFOCOM, 2013 Proceedings IEEE</i>, pages 2265-2273, April 2013. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/INFCOM.2013.6567030\"\n     onclick=\"log_download('safaka-fragouli-argyraki-diggavi-exchangingpairwisesecretsefficiently-2013', 'http://doi.org/10.1109/INFCOM.2013.6567030', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/safaka-fragouli-argyraki-diggavi-exchangingpairwisesecretsefficiently-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('safaka-fragouli-argyraki-diggavi-exchangingpairwisesecretsefficiently-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{6567030,\n abstract = {We consider the problem where a group of wireless nodes, connected to the same broadcast domain, want to create pairwise secrets, in the presence of an adversary Eve, who tries to listen in and steal these secrets. Existing solutions assume that Eve cannot perform certain computations (e.g., large-integer factorization) in useful time. We ask the question: can we solve this problem without assuming anything about Eve&#x27;s computational capabilities? We propose a simple secret-agreement protocol, where the wireless nodes keep exchanging bits until they have agreed on pairwise secrets that Eve cannot reconstruct with very high probability. Our protocol relies on Eve&#x27;s limited network presence (the fact that she cannot be located at an arbitrary number of points in the network at the same time), but assumes nothing about her computational capabilities. We formally show that, under standard theoretical assumptions, our protocol is information-theoretically secure (it leaks zero information to Eve about the secrets). Using a small wireless testbed of smart-phones, we provide experimental evidence that it is feasible for 5 nodes to create thousands of secret bits per second, with their secrecy being independent from the adversary&#x27;s capabilities.},\n author = {Safaka, I and Fragouli, C. and Argyraki, K. and Diggavi, S.},\n booktitle = {INFOCOM, 2013 Proceedings IEEE},\n doi = {10.1109/INFCOM.2013.6567030},\n file = {:papers:exchanging_secrets.pdf},\n issn = {0743-166X},\n month = {April},\n pages = {2265-2273},\n tags = {conf,WiNetSec,IT},\n title = {Exchanging pairwise secrets efficiently},\n type = {4},\n year = {2013}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider the problem where a group of wireless nodes, connected to the same broadcast domain, want to create pairwise secrets, in the presence of an adversary Eve, who tries to listen in and steal these secrets. Existing solutions assume that Eve cannot perform certain computations (e.g., large-integer factorization) in useful time. We ask the question: can we solve this problem without assuming anything about Eve's computational capabilities? We propose a simple secret-agreement protocol, where the wireless nodes keep exchanging bits until they have agreed on pairwise secrets that Eve cannot reconstruct with very high probability. Our protocol relies on Eve's limited network presence (the fact that she cannot be located at an arbitrary number of points in the network at the same time), but assumes nothing about her computational capabilities. We formally show that, under standard theoretical assumptions, our protocol is information-theoretically secure (it leaks zero information to Eve about the secrets). Using a small wireless testbed of smart-phones, we provide experimental evidence that it is feasible for 5 nodes to create thousands of secret bits per second, with their secrecy being independent from the adversary's capabilities.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"czap-prabhakaran-diggavi-fragouli-securingbroadcastagainstdishonestreceivers-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Czap;  V.M. Prabhakaran;  S. Diggavi;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Securing broadcast against dishonest receivers.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Network Coding (NetCod), 2013 International Symposium on</i>, pages 1-6, June 2013. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/NetCod.2013.6570819\"\n     onclick=\"log_download('czap-prabhakaran-diggavi-fragouli-securingbroadcastagainstdishonestreceivers-2013', 'http://doi.org/10.1109/NetCod.2013.6570819', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/czap-prabhakaran-diggavi-fragouli-securingbroadcastagainstdishonestreceivers-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('czap-prabhakaran-diggavi-fragouli-securingbroadcastagainstdishonestreceivers-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{6570819,\n abstract = {Consider a sender, Alice, who wants to transmit private messages to two receivers, Bob and Calvin, using unreliable wireless broadcast transmissions and short public feedback from Bob and Calvin. In [1], we assumed that Bob and Calvin provide honest feedback, and characterized the secure capacity region of the private messages under the requirement that Bob and Calvin do not learn each other&#x27;s message. In this paper, we assume that Bob (or Calvin) may provide dishonest feedback; or even control the input message distributions, as is commonly assumed in cryptography literature. We characterize the capacity region in the case of dishonest adversaries, as well as an achievable region for the case when the adversary has complete control on the distribution of the messages. We also design polynomial time protocols for both cases, that rely on the use of coding techniques to mix and secure the private messages. As a side result, we define an extended notion of semantic security for this problem and using a similar approach to [2], we show the equivalence of different security notions.},\n author = {Czap, L. and Prabhakaran, V.M. and Diggavi, S. and Fragouli, C.},\n booktitle = {Network Coding (NetCod), 2013 International Symposium on},\n doi = {10.1109/NetCod.2013.6570819},\n file = {:papers:securing_bc.pdf},\n month = {June},\n pages = {1-6},\n tags = {conf,WiNetSec,IT},\n title = {Securing broadcast against dishonest receivers},\n type = {4},\n year = {2013}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Consider a sender, Alice, who wants to transmit private messages to two receivers, Bob and Calvin, using unreliable wireless broadcast transmissions and short public feedback from Bob and Calvin. In [1], we assumed that Bob and Calvin provide honest feedback, and characterized the secure capacity region of the private messages under the requirement that Bob and Calvin do not learn each other's message. In this paper, we assume that Bob (or Calvin) may provide dishonest feedback; or even control the input message distributions, as is commonly assumed in cryptography literature. We characterize the capacity region in the case of dishonest adversaries, as well as an achievable region for the case when the adversary has complete control on the distribution of the messages. We also design polynomial time protocols for both cases, that rely on the use of coding techniques to mix and secure the private messages. As a side result, we define an extended notion of semantic security for this problem and using a similar approach to [2], we show the equivalence of different security notions.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"mishra-fragouli-prabhakaran-diggavi-usingfeedbackforsecrecyovergraphs-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S. Mishra;  C. Fragouli;  V. Prabhakaran;  and  S. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://arxiv.org/abs/1305.3051\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'mishra-fragouli-prabhakaran-diggavi-usingfeedbackforsecrecyovergraphs-2013', 'http://arxiv.org/abs/1305.3051', event);\">\n    Using feedback for secrecy over graphs.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on</i>, pages 2399-2403, July 2013. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://arxiv.org/abs/1305.3051\"\n     onclick=\"log_download('mishra-fragouli-prabhakaran-diggavi-usingfeedbackforsecrecyovergraphs-2013', 'http://arxiv.org/abs/1305.3051', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Using feedback for secrecy over graphs [link]\"\n       title=\" arxiv\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> arxiv</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1109/ISIT.2013.6620656\"\n     onclick=\"log_download('mishra-fragouli-prabhakaran-diggavi-usingfeedbackforsecrecyovergraphs-2013', 'http://doi.org/10.1109/ISIT.2013.6620656', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/mishra-fragouli-prabhakaran-diggavi-usingfeedbackforsecrecyovergraphs-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('mishra-fragouli-prabhakaran-diggavi-usingfeedbackforsecrecyovergraphs-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{6620656,\n abstract = {We study the problem of secure message multicasting over graphs in the presence of a passive (node) adversary who tries to eavesdrop in the network. We show that use of feedback, facilitated through the existence of cycles or undirected edges, enables higher rates than possible in directed acyclic graphs of the same mincut. We demonstrate this using code constructions for canonical combination networks (CCNs). We also provide general outer bounds as well as schemes for node adversaries over CCNs.},\n author = {Mishra, S. and Fragouli, C. and Prabhakaran, V. and Diggavi, S.},\n booktitle = {Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on},\n doi = {10.1109/ISIT.2013.6620656},\n issn = {2157-8095},\n month = {July},\n pages = {2399-2403},\n tags = {conf,WiNetSec,IT},\n title = {Using feedback for secrecy over graphs},\n type = {4},\n url_arxiv = {http://arxiv.org/abs/1305.3051},\n year = {2013}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We study the problem of secure message multicasting over graphs in the presence of a passive (node) adversary who tries to eavesdrop in the network. We show that use of feedback, facilitated through the existence of cycles or undirected edges, enables higher rates than possible in directed acyclic graphs of the same mincut. We demonstrate this using code constructions for canonical combination networks (CCNs). We also provide general outer bounds as well as schemes for node adversaries over CCNs.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"czap-prabhakaran-diggavi-fragouli-exploitingcommonrandomnessaresourcefornetworksecrecy-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Czap;  V.M. Prabhakaran;  S. Diggavi;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Exploiting common randomness: A resource for network secrecy.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Information Theory Workshop (ITW), 2013 IEEE</i>, pages 1-5, Sept 2013. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/ITW.2013.6691232\"\n     onclick=\"log_download('czap-prabhakaran-diggavi-fragouli-exploitingcommonrandomnessaresourcefornetworksecrecy-2013', 'http://doi.org/10.1109/ITW.2013.6691232', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/czap-prabhakaran-diggavi-fragouli-exploitingcommonrandomnessaresourcefornetworksecrecy-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('czap-prabhakaran-diggavi-fragouli-exploitingcommonrandomnessaresourcefornetworksecrecy-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{6691232,\n abstract = {We investigate the problem of secure communication in a simple network with three communicating parties, two distributed sources who communicate over orthogonal channels to one destination node. The cooperation between the sources is restricted to a rate limited common random source they both observe. The communication channels are erasure channels with strictly causal channel state information of the destination available publicly. A passive adversary is present in the system eavesdropping on any one of the channels. We design a linear scheme that ensures secrecy against the eavesdropper. By deriving an outer bound for the problem we prove that the scheme is optimal in certain special cases.},\n author = {Czap, L. and Prabhakaran, V.M. and Diggavi, S. and Fragouli, C.},\n booktitle = {Information Theory Workshop (ITW), 2013 IEEE},\n doi = {10.1109/ITW.2013.6691232},\n file = {:papers:common_randomness.pdf},\n month = {Sept},\n pages = {1-5},\n tags = {conf,WiNetSec,IT},\n title = {Exploiting common randomness: A resource for network secrecy},\n type = {4},\n year = {2013}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We investigate the problem of secure communication in a simple network with three communicating parties, two distributed sources who communicate over orthogonal channels to one destination node. The cooperation between the sources is restricted to a rate limited common random source they both observe. The communication channels are erasure channels with strictly causal channel state information of the destination available publicly. A passive adversary is present in the system eavesdropping on any one of the channels. We design a linear scheme that ensures secrecy against the eavesdropper. By deriving an outer bound for the problem we prove that the scheme is optimal in certain special cases.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"czap-fragouli-prabhakaran-diggavi-securenetworkcodingwitherasuresandfeedback-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Czap;  C. Fragouli;  V.M. Prabhakaran;  and  S. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Secure network coding with erasures and feedback.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Communication, Control, and Computing (Allerton), 2013 51st Annual Allerton Conference on</i>, pages 1517-1524, Oct 2013. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/Allerton.2013.6736707\"\n     onclick=\"log_download('czap-fragouli-prabhakaran-diggavi-securenetworkcodingwitherasuresandfeedback-2013', 'http://doi.org/10.1109/Allerton.2013.6736707', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/czap-fragouli-prabhakaran-diggavi-securenetworkcodingwitherasuresandfeedback-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('czap-fragouli-prabhakaran-diggavi-securenetworkcodingwitherasuresandfeedback-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{6736707,\n abstract = {Secure network coding assumes that the underlying network links are lossless, thus it can be applied over lossy networks after channel error correction. Yet it is well known that channel losses, such as packet erasures, can be constructively used for secrecy over a link. We address here the challenge of extending these results for arbitrary networks. We provide achievability schemes over erasure networks with feedback, that outperform the alternative approach of channel error correction followed by secure message transmission separation. We derive outer bounds on the securely achievable rate and as a consequence we show optimality of our proposed scheme in some special cases.},\n author = {Czap, L. and Fragouli, C. and Prabhakaran, V.M. and Diggavi, S.},\n booktitle = {Communication, Control, and Computing (Allerton), 2013 51st Annual Allerton Conference on},\n doi = {10.1109/Allerton.2013.6736707},\n file = {:papers:secure_netcod.pdf},\n month = {Oct},\n pages = {1517-1524},\n tags = {conf,WiNetSec,IT},\n title = {Secure network coding with erasures and feedback},\n type = {4},\n year = {2013}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Secure network coding assumes that the underlying network links are lossless, thus it can be applied over lossy networks after channel error correction. Yet it is well known that channel losses, such as packet erasures, can be constructively used for secrecy over a link. We address here the challenge of extending these results for arbitrary networks. We provide achievability schemes over erasure networks with feedback, that outperform the alternative approach of channel error correction followed by secure message transmission separation. We derive outer bounds on the securely achievable rate and as a consequence we show optimality of our proposed scheme in some special cases.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"argyraki-diggavi-duarte-fragouli-gatzianas-kostopoulos-creatingsecretsoutoferasures-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Katerina Argyraki;  Suhas Diggavi;  Melissa Duarte;  Christina Fragouli;  Marios Gatzianas;  and  Panagiotis Kostopoulos.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Creating secrets out of erasures.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 19th annual international conference on Mobile computing & networking</i>, pages 429–440, Sep 2013. ACM\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/argyraki-diggavi-duarte-fragouli-gatzianas-kostopoulos-creatingsecretsoutoferasures-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('argyraki-diggavi-duarte-fragouli-gatzianas-kostopoulos-creatingsecretsoutoferasures-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{argyraki2013creating,\n abstract = {Current security systems often rely on the adversary&#x27;s computational limitations. Wireless networks offer the opportunity for a different, complementary kind of security, which relies on the adversary&#x27;s limited network presence (i.e., that the adversary cannot be located at many different points in the network at the same time). We present a system that leverages this opportunity to enable n wireless nodes to create a shared secret S, in a way that an eavesdropper, Eve, obtains very little information on S. Our system consists of two steps: (1) The nodes transmit packets following a special pattern, such that Eve learns very little about a given fraction of the transmitted packets. This is achieved through a combination of beam forming (from many different sources) and wiretap codes. (2) The nodes participate in a protocol that reshuffles the information known to each node, such that the nodes end up sharing a secret that Eve knows very little about. Our protocol is easily implementable in existing wireless devices and scales well with the number of nodes; these properties are achieved through a combination of public feedback, broadcasting, and network coding. We evaluate our system through a 5-node testbed. We demonstrate that a group of wireless nodes can generate thousands of new shared secret bits per second, with their secrecy being independent of the adversary&#x27;s computational capabilities.},\n author = {Argyraki, Katerina and Diggavi, Suhas and Duarte, Melissa and Fragouli, Christina and Gatzianas, Marios and Kostopoulos, Panagiotis},\n booktitle = {Proceedings of the 19th annual international conference on Mobile computing \\&amp; networking},\n file = {:papers:creating_secrets.pdf},\n month = {Sep},\n organization = {ACM},\n pages = {429--440},\n tags = {conf,WiNetSec,IT},\n title = {Creating secrets out of erasures},\n type = {4},\n year = {2013}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Current security systems often rely on the adversary's computational limitations. Wireless networks offer the opportunity for a different, complementary kind of security, which relies on the adversary's limited network presence (i.e., that the adversary cannot be located at many different points in the network at the same time). We present a system that leverages this opportunity to enable n wireless nodes to create a shared secret S, in a way that an eavesdropper, Eve, obtains very little information on S. Our system consists of two steps: (1) The nodes transmit packets following a special pattern, such that Eve learns very little about a given fraction of the transmitted packets. This is achieved through a combination of beam forming (from many different sources) and wiretap codes. (2) The nodes participate in a protocol that reshuffles the information known to each node, such that the nodes end up sharing a secret that Eve knows very little about. Our protocol is easily implementable in existing wireless devices and scales well with the number of nodes; these properties are achieved through a combination of public feedback, broadcasting, and network coding. We evaluate our system through a 5-node testbed. We demonstrate that a group of wireless nodes can generate thousands of new shared secret bits per second, with their secrecy being independent of the adversary's computational capabilities.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2012\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2012')\"\n      onkeypress=\"toggleGroup('group_2012')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2012</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"khisti-diggavi-wornell-secretkeygenerationusingcorrelatedsourcesandchannels-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   A Khisti;  S.N. Diggavi;  and  Gregory W. Wornell.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Secret-Key Generation Using Correlated Sources and Channels.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Information Theory, IEEE Transactions on</i>, 58(2): 652-670. Feb 2012.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/TIT.2011.2173629\"\n     onclick=\"log_download('khisti-diggavi-wornell-secretkeygenerationusingcorrelatedsourcesandchannels-2012', 'http://doi.org/10.1109/TIT.2011.2173629', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/khisti-diggavi-wornell-secretkeygenerationusingcorrelatedsourcesandchannels-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('khisti-diggavi-wornell-secretkeygenerationusingcorrelatedsourcesandchannels-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{kdw_j11,\n abstract = {We study the secret-key capacity in a joint source-channel coding setup-the terminals are connected over a discrete memoryless channel and have access to side information, modelled as a pair of discrete memoryless source sequences. As our main result, we establish the upper and lower bounds on the secret-key capacity. In the lower bound expression, the equivocation terms of the source and channel components are functionally additive even though the coding scheme generates a single secret-key by jointly taking into account the source and channel equivocations. Our bounds coincide, thus establishing the capacity, when the underlying wiretap channel can be decomposed into a set of independent, parallel, and reversely degraded channels. For the case of parallel Gaussian channels and jointly Gaussian sources we show that Gaussian codebooks achieve the secret-key capacity. In addition, when the eavesdropper also observes a correlated side information sequence, we establish the secret-key capacity when both the source and channel of the eavesdropper are a degraded version of the legitimate receiver. We finally also treat the case when a public discussion channel is available, propose a separation based coding scheme, and establish its optimality when the channel output symbols of the legitimate receiver and eavesdropper are conditionally independent given the input.},\n author = {Khisti, A and Diggavi, S.N. and Wornell, Gregory W.},\n doi = {10.1109/TIT.2011.2173629},\n file = {:papers:secret_keygen.pdf},\n issn = {0018-9448},\n journal = {Information Theory, IEEE Transactions on},\n label = {kdw_j11},\n month = {Feb},\n number = {2},\n pages = {652-670},\n tags = {journal,ITsecrecy,KeyGen,IT,WiNetSec,SrcChanSec},\n title = {Secret-Key Generation Using Correlated Sources and Channels},\n type = {2},\n volume = {58},\n year = {2012}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We study the secret-key capacity in a joint source-channel coding setup-the terminals are connected over a discrete memoryless channel and have access to side information, modelled as a pair of discrete memoryless source sequences. As our main result, we establish the upper and lower bounds on the secret-key capacity. In the lower bound expression, the equivocation terms of the source and channel components are functionally additive even though the coding scheme generates a single secret-key by jointly taking into account the source and channel equivocations. Our bounds coincide, thus establishing the capacity, when the underlying wiretap channel can be decomposed into a set of independent, parallel, and reversely degraded channels. For the case of parallel Gaussian channels and jointly Gaussian sources we show that Gaussian codebooks achieve the secret-key capacity. In addition, when the eavesdropper also observes a correlated side information sequence, we establish the secret-key capacity when both the source and channel of the eavesdropper are a degraded version of the legitimate receiver. We finally also treat the case when a public discussion channel is available, propose a separation based coding scheme, and establish its optimality when the channel output symbols of the legitimate receiver and eavesdropper are conditionally independent given the input.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"czap-prabhakaran-diggavi-fragouli-oninteractivesecrecyovererasurenetworks-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Czap;  V.M. Prabhakaran;  S. Diggavi;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On interactive secrecy over erasure networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Communications Control and Signal Processing (ISCCSP), 2012 5th International Symposium on</i>, pages 1-4, May 2012. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/ISCCSP.2012.6217871\"\n     onclick=\"log_download('czap-prabhakaran-diggavi-fragouli-oninteractivesecrecyovererasurenetworks-2012', 'http://doi.org/10.1109/ISCCSP.2012.6217871', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/czap-prabhakaran-diggavi-fragouli-oninteractivesecrecyovererasurenetworks-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('czap-prabhakaran-diggavi-fragouli-oninteractivesecrecyovererasurenetworks-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{6217871,\n abstract = {In this short review paper we summarize some of our recent results on interactive message secrecy for broadcast erasure channels.},\n author = {Czap, L. and Prabhakaran, V.M. and Diggavi, S. and Fragouli, C.},\n booktitle = {Communications Control and Signal Processing (ISCCSP), 2012 5th International Symposium on},\n doi = {10.1109/ISCCSP.2012.6217871},\n file = {:papers:interactive_secrecy.pdf},\n month = {May},\n pages = {1-4},\n tags = {conf,WiNetSec},\n title = {On interactive secrecy over erasure networks},\n type = {4},\n year = {2012}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this short review paper we summarize some of our recent results on interactive message secrecy for broadcast erasure channels.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"czap-prabhakaran-diggavi-fragouli-broadcastingprivatemessagessecurely-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Czap;  V.M. Prabhakaran;  S. Diggavi;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Broadcasting private messages securely.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on</i>, pages 428-432, July 2012. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/ISIT.2012.6284224\"\n     onclick=\"log_download('czap-prabhakaran-diggavi-fragouli-broadcastingprivatemessagessecurely-2012', 'http://doi.org/10.1109/ISIT.2012.6284224', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/czap-prabhakaran-diggavi-fragouli-broadcastingprivatemessagessecurely-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('czap-prabhakaran-diggavi-fragouli-broadcastingprivatemessagessecurely-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{6284224,\n abstract = {Consider a source, Alice, broadcasting private messages to multiple receivers through a broadcast erasure channel; users send back to Alice public feedback that she causally uses to decide the coding strategy for her following transmissions. Recently, the multiple unicast capacity region for this problem has been exactly characterized for a number of special cases; namely the 2-user, 3-user, symmetric K-user, and one-sidedly fair K-user [1], [2]. In this paper, we show that for all the cases where such characterizations exist, we can also optimally characterize the “secure” communication rates, where the message that Alice transmits to each user is information theoretically secure from the other users, even if these collude. We show that a simple, two-phase strategy, where appropriate amounts of secret keys are first generated and then consumed, matches a new outer bound we derive.},\n author = {Czap, L. and Prabhakaran, V.M. and Diggavi, S. and Fragouli, C.},\n booktitle = {Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on},\n doi = {10.1109/ISIT.2012.6284224},\n file = {:papers:bc_private_msg.pdf},\n issn = {2157-8095},\n month = {July},\n pages = {428-432},\n tags = {conf,WiNetSec,IT},\n title = {Broadcasting private messages securely},\n type = {4},\n year = {2012}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Consider a source, Alice, broadcasting private messages to multiple receivers through a broadcast erasure channel; users send back to Alice public feedback that she causally uses to decide the coding strategy for her following transmissions. Recently, the multiple unicast capacity region for this problem has been exactly characterized for a number of special cases; namely the 2-user, 3-user, symmetric K-user, and one-sidedly fair K-user [1], [2]. In this paper, we show that for all the cases where such characterizations exist, we can also optimally characterize the “secure” communication rates, where the message that Alice transmits to each user is information theoretically secure from the other users, even if these collude. We show that a simple, two-phase strategy, where appropriate amounts of secret keys are first generated and then consumed, matches a new outer bound we derive.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"safaka-fragouli-argyraki-diggavi-creatingsharedsecretsoutofthinair-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Iris Safaka;  Christina Fragouli;  Katerina Argyraki;  and  Suhas Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Creating shared secrets out of thin air.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 11th ACM Workshop on Hot Topics in Networks</i>, pages 73–78, Oct 2012. ACM\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/safaka-fragouli-argyraki-diggavi-creatingsharedsecretsoutofthinair-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('safaka-fragouli-argyraki-diggavi-creatingsharedsecretsoutofthinair-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{safaka2012creating,\n abstract = {Current security systems typically rely on the adversary&#x27;s computational limitations (e.g., the fact that it cannot invert a hash function or perform large-integer factorization). Wireless networks offer the opportunity for a different, complementary kind of security, which relies not on the adversary&#x27;s computational limitations, but on its limited network presence (i.e., that the adversary cannot be located at many different points in the network at the same time). We take a first step toward designing and building a wireless security system that leverages this opportunity: We consider the problem where a group of n nodes, connected to the same broadcast wireless network, want to agree on a shared secret (e.g., an encryption key), in the presence of an adversary Eve who tries to listen in and steal the secret. We propose a secret-agreement protocol, where the n nodes of the group keep exchanging bits until they have all agreed on a bit sequence that Eve cannot reconstruct (with very high probability). We provide experimental evidence---to the best of our knowledge, the first one---that a group of wireless nodes can generate thousands of new shared secret bits per second, with their secrecy being independent of the adversary&#x27;s computational capabilities.},\n author = {Safaka, Iris and Fragouli, Christina and Argyraki, Katerina and Diggavi, Suhas},\n booktitle = {Proceedings of the 11th ACM Workshop on Hot Topics in Networks},\n file = {:papers:secrets_thin_air.pdf},\n month = {Oct},\n organization = {ACM},\n pages = {73--78},\n tags = {conf,WiNetSec,IT},\n title = {Creating shared secrets out of thin air},\n type = {4},\n year = {2012}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Current security systems typically rely on the adversary's computational limitations (e.g., the fact that it cannot invert a hash function or perform large-integer factorization). Wireless networks offer the opportunity for a different, complementary kind of security, which relies not on the adversary's computational limitations, but on its limited network presence (i.e., that the adversary cannot be located at many different points in the network at the same time). We take a first step toward designing and building a wireless security system that leverages this opportunity: We consider the problem where a group of n nodes, connected to the same broadcast wireless network, want to agree on a shared secret (e.g., an encryption key), in the presence of an adversary Eve who tries to listen in and steal the secret. We propose a secret-agreement protocol, where the n nodes of the group keep exchanging bits until they have all agreed on a bit sequence that Eve cannot reconstruct (with very high probability). We provide experimental evidence—to the best of our knowledge, the first one—that a group of wireless nodes can generate thousands of new shared secret bits per second, with their secrecy being independent of the adversary's computational capabilities.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2011\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2011')\"\n      onkeypress=\"toggleGroup('group_2011')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2011</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"khisti-diggavi-wornell-secretkeyagreementoverwiretapchannelswithrandomstateparameters-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   A. Khisti;  S N. Diggavi;  and  G W. Wornell.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://arxiv.org/abs/1009.3052\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'khisti-diggavi-wornell-secretkeyagreementoverwiretapchannelswithrandomstateparameters-2011', 'http://arxiv.org/abs/1009.3052', event);\">\n    Secret-key agreement over wiretap channels with random state parameters.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Forensics and Security</i>, 6: 672-681. Sep 2011.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://arxiv.org/abs/1009.3052\"\n     onclick=\"log_download('khisti-diggavi-wornell-secretkeyagreementoverwiretapchannelswithrandomstateparameters-2011', 'http://arxiv.org/abs/1009.3052', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Secret-key agreement over wiretap channels with random state parameters [link]\"\n       title=\" arxiv\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> arxiv</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/khisti-diggavi-wornell-secretkeyagreementoverwiretapchannelswithrandomstateparameters-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('khisti-diggavi-wornell-secretkeyagreementoverwiretapchannelswithrandomstateparameters-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{KDWj10,\n author = {A. Khisti and S N. Diggavi and G W. Wornell},\n journal = {IEEE Transactions  on Information Forensics and Security},\n month = {Sep},\n note = {},\n pages = {672-681},\n tags = {journal,ITsecrecy,KeyGen,IT,WiNetSec},\n title = {Secret-key agreement over wiretap channels with random state parameters},\n type = {2},\n url_arxiv = {http://arxiv.org/abs/1009.3052},\n volume = {6},\n year = {2011}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (4)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"siavoshani-mishra-diggavi-fragouli-groupsecretkeyagreementoverstatedependentwirelessbroadcastchannels-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   M.J. Siavoshani;  S. Mishra;  S.N. Diggavi;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Group secret key agreement over state-dependent wireless broadcast channels.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on</i>, pages 1960-1964, July 2011. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/ISIT.2011.6033895\"\n     onclick=\"log_download('siavoshani-mishra-diggavi-fragouli-groupsecretkeyagreementoverstatedependentwirelessbroadcastchannels-2011', 'http://doi.org/10.1109/ISIT.2011.6033895', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/siavoshani-mishra-diggavi-fragouli-groupsecretkeyagreementoverstatedependentwirelessbroadcastchannels-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('siavoshani-mishra-diggavi-fragouli-groupsecretkeyagreementoverstatedependentwirelessbroadcastchannels-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{6033895,\n abstract = {We consider a group of m trusted nodes that aim to create a shared secret key K, using a state-dependent wireless broadcast channel that exists from one of the honest nodes to the rest of the nodes including a passive eavesdropper Eve. All of the trusted nodes can also discuss over a cost-free and unlimited rate public channel which is also observed by Eve. For this setup, we develop an information-theoretically secure secret key agreement protocol. We show the optimality of this protocol for linear deterministic wireless broadcast channels as well as in the high-SNR regime for wireless channels with large dynamic range over channel states.},\n author = {Siavoshani, M.J. and Mishra, S. and Diggavi, S.N. and Fragouli, C.},\n booktitle = {Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on},\n doi = {10.1109/ISIT.2011.6033895},\n file = {:papers:group_secret_key.pdf},\n issn = {2157-8095},\n month = {July},\n pages = {1960-1964},\n tags = {conf,WiNetSec,IT},\n title = {Group secret key agreement over state-dependent wireless broadcast channels},\n type = {4},\n year = {2011}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider a group of m trusted nodes that aim to create a shared secret key K, using a state-dependent wireless broadcast channel that exists from one of the honest nodes to the rest of the nodes including a passive eavesdropper Eve. All of the trusted nodes can also discuss over a cost-free and unlimited rate public channel which is also observed by Eve. For this setup, we develop an information-theoretically secure secret key agreement protocol. We show the optimality of this protocol for linear deterministic wireless broadcast channels as well as in the high-SNR regime for wireless channels with large dynamic range over channel states.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"czap-prabhakaran-fragouli-diggavi-secretmessagecapacityoferasurebroadcastchannelswithfeedback-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Czap;  V.M. Prabhakaran;  C. Fragouli;  and  S. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Secret message capacity of erasure broadcast channels with feedback.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Information Theory Workshop (ITW), 2011 IEEE</i>, pages 65-69, Oct 2011. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/czap-prabhakaran-fragouli-diggavi-secretmessagecapacityoferasurebroadcastchannelswithfeedback-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('czap-prabhakaran-fragouli-diggavi-secretmessagecapacityoferasurebroadcastchannelswithfeedback-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{6089579,\n abstract = {We characterize the secret message capacity of a wiretapped erasure channel where causal channel state information of the honest nodes is publicly available. In doing so, we establish an intimate connection between message secrecy and secret key generation for the same channel setup. We propose a linear coding scheme that has polynomial encoding/decoding complexity, and prove a converse that shows the optimality of our scheme. Our work also demonstrates the value of causal public feedback, which has previously been shown for the secret key generation problem.},\n author = {Czap, L. and Prabhakaran, V.M. and Fragouli, C. and Diggavi, S.},\n booktitle = {Information Theory Workshop (ITW), 2011 IEEE},\n file = {:papers:secret_erasure_bc.pdf},\n month = {Oct},\n pages = {65-69},\n tags = {conf,WiNetSec,IT},\n title = {Secret message capacity of erasure broadcast channels with feedback},\n type = {4},\n year = {2011}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We characterize the secret message capacity of a wiretapped erasure channel where causal channel state information of the honest nodes is publicly available. In doing so, we establish an intimate connection between message secrecy and secret key generation for the same channel setup. We propose a linear coding scheme that has polynomial encoding/decoding complexity, and prove a converse that shows the optimality of our scheme. Our work also demonstrates the value of causal public feedback, which has previously been shown for the secret key generation problem.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"mohajer-diggavi-poor-shamai-ontheparallelrelaywiretapnetwork-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S. Mohajer;  S.N. Diggavi;  H.V. Poor;  and  S. Shamai.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On the parallel relay wire-tap network.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Communication, Control, and Computing (Allerton), 2011 49th Annual Allerton Conference on</i>, pages 418-425, Sept 2011. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/Allerton.2011.6120197\"\n     onclick=\"log_download('mohajer-diggavi-poor-shamai-ontheparallelrelaywiretapnetwork-2011', 'http://doi.org/10.1109/Allerton.2011.6120197', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/mohajer-diggavi-poor-shamai-ontheparallelrelaywiretapnetwork-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('mohajer-diggavi-poor-shamai-ontheparallelrelaywiretapnetwork-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{6120197,\n abstract = {Information-theoretic secrecy is studied for a parallel relay (diamond) network, in which a transmitter wishes to communicate to a receiver through two relay nodes. While there is no direct link between the transmitter and receiver and all flow of information has to be transmitted through the relays, the message has to be kept secret from each of them. The exact secrecy capacity is characterized for the network under the linear deterministic model. The problem is then studied when each terminal is equipped with multiple antennas, and the channels are parallel Gaussian links. Lower and upper bounds for the secrecy capacity are derived, and the gap is bounded by a constant independent of the channel parameters and SNR. This results in an approximate characterization for the secrecy capacity of the parallel Gaussian diamond network.},\n author = {Mohajer, S. and Diggavi, S.N. and Poor, H.V. and Shamai, S.},\n booktitle = {Communication, Control, and Computing (Allerton), 2011 49th Annual Allerton Conference on},\n doi = {10.1109/Allerton.2011.6120197},\n file = {:papers:parallel_wiretap.pdf},\n month = {Sept},\n pages = {418-425},\n tags = {conf,IT,WiNetSec,WiNet},\n title = {On the parallel relay wire-tap network},\n type = {4},\n year = {2011}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Information-theoretic secrecy is studied for a parallel relay (diamond) network, in which a transmitter wishes to communicate to a receiver through two relay nodes. While there is no direct link between the transmitter and receiver and all flow of information has to be transmitted through the relays, the message has to be kept secret from each of them. The exact secrecy capacity is characterized for the network under the linear deterministic model. The problem is then studied when each terminal is equipped with multiple antennas, and the channels are parallel Gaussian links. Lower and upper bounds for the secrecy capacity are derived, and the gap is bounded by a constant independent of the channel parameters and SNR. This results in an approximate characterization for the secrecy capacity of the parallel Gaussian diamond network.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"khisti-diggavi-aremarkonsecretkeygenerationovercorrelatedfadingchannels-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   A Khisti;  and  S.N. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A remark on secret-key generation over correlated fading channels.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>GLOBECOM Workshops (GC Wkshps), 2011 IEEE</i>, pages 864-868, Dec 2011. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/GLOCOMW.2011.6162578\"\n     onclick=\"log_download('khisti-diggavi-aremarkonsecretkeygenerationovercorrelatedfadingchannels-2011', 'http://doi.org/10.1109/GLOCOMW.2011.6162578', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/khisti-diggavi-aremarkonsecretkeygenerationovercorrelatedfadingchannels-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('khisti-diggavi-aremarkonsecretkeygenerationovercorrelatedfadingchannels-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{6162578,\n abstract = {We study secret-key agreement with public discussion over a flat-fading wiretap channel model. The fading gains are correlated across the receivers and sampled independently at each time. Perfect receiver channel state information (CSI) is assumed, whereas a noisy CSI of the main channel is also available to the transmitter. We propose lower and upper bounds on the capacity. Our lower bound is achieved by a coding scheme that involves a separate binning of the receiver CSI sequence and its channel output sequence. In general it improves upon the joint-binning schemes considered in earlier works. Our upper and lower bounds coincide, establishing the capacity, when either the transmitter has no CSI or when the channel gains of the legitimate receiver and the eavesdropper are statistically independent.},\n author = {Khisti, A and Diggavi, S.N.},\n booktitle = {GLOBECOM Workshops (GC Wkshps), 2011 IEEE},\n doi = {10.1109/GLOCOMW.2011.6162578},\n file = {:papers:remark_secret_keygen.pdf},\n month = {Dec},\n pages = {864-868},\n tags = {conf,WiNetSec,IT},\n title = {A remark on secret-key generation over correlated fading channels},\n type = {4},\n year = {2011}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We study secret-key agreement with public discussion over a flat-fading wiretap channel model. The fading gains are correlated across the receivers and sampled independently at each time. Perfect receiver channel state information (CSI) is assumed, whereas a noisy CSI of the main channel is also available to the transmitter. We propose lower and upper bounds on the capacity. Our lower bound is achieved by a coding scheme that involves a separate binning of the receiver CSI sequence and its channel output sequence. In general it improves upon the joint-binning schemes considered in earlier works. Our upper and lower bounds coincide, establishing the capacity, when either the transmitter has no CSI or when the channel gains of the legitimate receiver and the eavesdropper are statistically independent.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2010\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2010')\"\n      onkeypress=\"toggleGroup('group_2010')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2010</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"siavoshani-fragouli-diggavi-pulleti-argyraki-groupsecretkeygenerationoverbroadcasterasurechannels-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   M.J. Siavoshani;  C. Fragouli;  S. Diggavi;  U. Pulleti;  and  K. Argyraki.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Group secret key generation over broadcast erasure channels.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Signals, Systems and Computers (ASILOMAR), 2010 Conference Record of the Forty Fourth Asilomar Conference on</i>, pages 719-723, Nov 2010. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/ACSSC.2010.5757657\"\n     onclick=\"log_download('siavoshani-fragouli-diggavi-pulleti-argyraki-groupsecretkeygenerationoverbroadcasterasurechannels-2010', 'http://doi.org/10.1109/ACSSC.2010.5757657', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/siavoshani-fragouli-diggavi-pulleti-argyraki-groupsecretkeygenerationoverbroadcasterasurechannels-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('siavoshani-fragouli-diggavi-pulleti-argyraki-groupsecretkeygenerationoverbroadcasterasurechannels-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{5757657,\n abstract = {We consider a group of m trusted nodes that aim to create a shared secret key K over a wireless channel in the presence an eavesdropper Eve. We assume an erasure broadcast channel from one of the honest nodes to the rest of them including Eve. All of the trusted nodes can also discuss over a cost-free public channel which is observed by Eve. For this setup we characterize the secret key generation capacity and propose an achievability scheme that is computationally efficient and employs techniques from network coding. Surprisingly, whether we have m = 2 nodes, or an arbitrary number m of nodes, we can establish a shared secret key among them at the same rate, independently of m.},\n author = {Siavoshani, M.J. and Fragouli, C. and Diggavi, S. and Pulleti, U. and Argyraki, K.},\n booktitle = {Signals, Systems and Computers (ASILOMAR), 2010 Conference Record of the Forty Fourth Asilomar Conference on},\n doi = {10.1109/ACSSC.2010.5757657},\n issn = {1058-6393},\n month = {Nov},\n pages = {719-723},\n tags = {conf,IT,WiNetSec},\n title = {Group secret key generation over broadcast erasure channels},\n type = {4},\n year = {2010}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider a group of m trusted nodes that aim to create a shared secret key K over a wireless channel in the presence an eavesdropper Eve. We assume an erasure broadcast channel from one of the honest nodes to the rest of them including Eve. All of the trusted nodes can also discuss over a cost-free public channel which is observed by Eve. For this setup we characterize the secret key generation capacity and propose an achievability scheme that is computationally efficient and employs techniques from network coding. Surprisingly, whether we have m = 2 nodes, or an arbitrary number m of nodes, we can establish a shared secret key among them at the same rate, independently of m.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2009\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2009')\"\n      onkeypress=\"toggleGroup('group_2009')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2009</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (4)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"khisti-diggavi-wornell-secretkeyagreementusingasymmetryinchannelstateknowledge-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   A. Khisti;  S N. Diggavi;  and  G W. Wornell.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Secret key agreement using asymmetry in channel state knowledge.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Information Theory (ISIT), Seoul, Korea</i>, pages 2286–2290, June 2009. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/khisti-diggavi-wornell-secretkeyagreementusingasymmetryinchannelstateknowledge-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('khisti-diggavi-wornell-secretkeyagreementusingasymmetryinchannelstateknowledge-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{KTWj09,\n author = {A. Khisti and S N. Diggavi and G W. Wornell},\n booktitle = {IEEE International Symposium on Information Theory (ISIT), Seoul, Korea},\n month = {June},\n note = {},\n pages = {2286--2290},\n tags = {conf,ITsecrecy,KeyGen,IT,WiNetSec},\n title = {Secret key agreement using asymmetry in channel state knowledge},\n type = {4},\n year = {2009}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"perron-diggavi-etelatar-onnoiseinsertionstrategiesforwirelessnetworksecrecy-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   E. Perron;  S N. Diggavi;  and   E. Telatar.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On noise insertion strategies for wireless network secrecy.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Information Theory and Applications workshop (ITA), UCSD, San Diego, California</i>, pages 77–84, February 2009. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/perron-diggavi-etelatar-onnoiseinsertionstrategiesforwirelessnetworksecrecy-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('perron-diggavi-etelatar-onnoiseinsertionstrategiesforwirelessnetworksecrecy-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{PDTc09d,\n abstract = {This paper studies the idea of noise insertion by authenticated relays through friendly jamming. We develop the secrecy rate achievable in arbitrary (deterministic) networks when there are relays actively helping secrecy.},\n author = {E. Perron and S N. Diggavi and E. Telatar,},\n booktitle = {Information Theory and Applications workshop (ITA), UCSD, San Diego, California},\n file = {:papers:pdtita09final.pdf},\n label = {pdtc09d},\n month = {February},\n note = {},\n pages = {77--84},\n tags = {conf,ITsecrecy,IT,WiNetSec,WiNetInfFlow,ITapprox,WiNet},\n title = {On noise insertion strategies for wireless network secrecy},\n type = {4},\n year = {2009}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper studies the idea of noise insertion by authenticated relays through friendly jamming. We develop the secrecy rate achievable in arbitrary (deterministic) networks when there are relays actively helping secrecy.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"perron-diggavi-telatar-oncooperativewirelessnetworksecrecy-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   E. Perron;  S N. Diggavi;  and  I E. Telatar.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On cooperative wireless network secrecy.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE INFOCOM 2009, Rio de Janeiro, Brazil</i>, April 2009. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/perron-diggavi-telatar-oncooperativewirelessnetworksecrecy-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('perron-diggavi-telatar-oncooperativewirelessnetworksecrecy-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{PDTp09,\n abstract = {In this paper we consider\nsecret communication between two special nodes (“source” and\n“destination”) in a wireless network with authenticated relays:\nthe message communicated to the destination is to be kept\ninformation-theoretically (unconditionally) secret from any eavesdropper\nwithin a class. Since the transmissions are broadcast and\ninterfere with each other, complex signal interactions occur. We\ndevelop cooperative schemes which utilize these interactions in\nwireless communication over networks with arbitrary topology,\nand give provable unconditional secrecy guarantees.},\n author = {E. Perron and S N. Diggavi and I E. Telatar},\n booktitle = {IEEE INFOCOM 2009, Rio de Janeiro, Brazil},\n file = {:papers:pdtwireless_net_secrecy08.pdf},\n label = {pdt_c09a},\n month = {April},\n note = {},\n pages = {},\n tags = {conf,ITsecrecy,IT,WiNetSec,WiNetInfFlow,WiNet,SelConf},\n title = {On cooperative wireless network secrecy},\n type = {4},\n year = {2009}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper we consider secret communication between two special nodes (“source” and “destination”) in a wireless network with authenticated relays: the message communicated to the destination is to be kept information-theoretically (unconditionally) secret from any eavesdropper within a class. Since the transmissions are broadcast and interfere with each other, complex signal interactions occur. We develop cooperative schemes which utilize these interactions in wireless communication over networks with arbitrary topology, and give provable unconditional secrecy guarantees.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"perron-diggavi-telatar-amultipleaccessapproachforthecompoundwiretapchannel-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   E. Perron;  S N. Diggavi;  and  I E. Telatar.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A multiple access approach for the compound wiretap channel.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Information Theory Workshop (ITW), Taormina, Italy</i>, pages 11–15, October 2009. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/perron-diggavi-telatar-amultipleaccessapproachforthecompoundwiretapchannel-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('perron-diggavi-telatar-amultipleaccessapproachforthecompoundwiretapchannel-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{PDTp09a,\n abstract = {The compound wiretap channel generalizes the\nclassical problem in broadcast information-theoretic secrecy by\nallowing a class of potential eavesdroppers. In this paper we\npresent a new coding scheme that generalizes known approaches\nto this problem. The scheme prefixes an artificial multiple\naccess channel to the transmission scheme in order to design a\nstructured transmit codebook. The idea is that such a structure\ncan potentially increase the perfect secrecy rate for the legitimate\nusers in the presence of the class of eavesdroppers.},\n author = {E. Perron and S N. Diggavi and I E. Telatar},\n booktitle = {IEEE Information Theory Workshop (ITW), Taormina, Italy},\n file = {:papers:pdt09mac_wiretap.pdf},\n month = {October},\n note = {},\n pages = {11--15},\n tags = {conf,ITsecrecy,IT,WiNetSec,SelConf},\n title = {A multiple access approach for the compound wiretap channel},\n type = {4},\n year = {2009}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The compound wiretap channel generalizes the classical problem in broadcast information-theoretic secrecy by allowing a class of potential eavesdroppers. In this paper we present a new coding scheme that generalizes known approaches to this problem. The scheme prefixes an artificial multiple access channel to the transmission scheme in order to design a structured transmit codebook. The idea is that such a structure can potentially increase the perfect secrecy rate for the legitimate users in the presence of the class of eavesdroppers.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2008\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2008')\"\n      onkeypress=\"toggleGroup('group_2008')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2008</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"khisti-diggavi-gwwornell-secretkeygenerationwithcorrelatedsourcesandnoisychannels-2008\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   A. Khisti;  S N. Diggavi;  and   G W. Wornell.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Secret key generation with correlated sources and noisy channels.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Information Theory (ISIT), Toronto, Canada</i>, pages 1005–1009, July 2008. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/khisti-diggavi-gwwornell-secretkeygenerationwithcorrelatedsourcesandnoisychannels-2008\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('khisti-diggavi-gwwornell-secretkeygenerationwithcorrelatedsourcesandnoisychannels-2008')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{KDWj08,\n author = {A. Khisti and S N. Diggavi and G W. Wornell,},\n booktitle = {IEEE International Symposium on Information Theory (ISIT), Toronto, Canada},\n month = {July},\n note = {},\n pages = {1005--1009},\n tags = {conf,ITsecrecy,KeyGen,IT,WiNetSec,SrcChanSec},\n title = {Secret key generation with correlated sources and noisy channels},\n type = {4},\n year = {2008}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"perron-diggavi-telatar-wirelessnetworksecrecywithpublicfeedback-2008\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   E. Perron;  S N. Diggavi;  and  E. Telatar.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Wireless network secrecy with public feedback.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of Allerton Conference on Communication, Control, and Computing, Illinois</i>, pages 753–760, September 2008. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/perron-diggavi-telatar-wirelessnetworksecrecywithpublicfeedback-2008\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('perron-diggavi-telatar-wirelessnetworksecrecywithpublicfeedback-2008')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{PDTj08,\n abstract = {We study a line network with an eavesdropper having access to the\nrelay transmission. We assume that there could also be a public feedback channel from the destination. We develop achievable strategies to achieve certain rate-equivocation pairs.},\n author = {E. Perron and S N. Diggavi and E. Telatar},\n booktitle = {Proceedings of Allerton Conference on Communication, Control, and Computing, Illinois},\n file = {:papers:pdt_allerton08.pdf},\n month = {September},\n note = {},\n pages = {753--760},\n tags = {conf,ITsecrecy,IT,WiNetSec,WiNetInfFlow,WiNet,InteractiveSec,SelConf},\n title = {Wireless network secrecy with public feedback},\n type = {4},\n year = {2008}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We study a line network with an eavesdropper having access to the relay transmission. We assume that there could also be a public feedback channel from the destination. We develop achievable strategies to achieve certain rate-equivocation pairs.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n  </div>\n\n\n  <!-- Modal -->\n\n  <!-- <iframe id=\"bibbase_network_frame\" -->\n  <!--         src=\"//bibbase.org/network/control\" -->\n  <!--         style=\"display: none;\"> -->\n  <!-- </iframe> -->\n\n</div>\n"}; document.write(bibbase_data.data);